./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8 --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 e1d84228246cc640f111b0bf0907a0ec6838e3ee0e70770c8d77ae15dd23f4db --- 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-e04fb08 [2022-11-16 12:47:33,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:47:33,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:47:33,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:47:33,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:47:33,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:47:33,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:47:33,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:47:33,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:47:33,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:47:33,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:47:33,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:47:33,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:47:33,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:47:33,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:47:33,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:47:33,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:47:33,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:47:33,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:47:33,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:47:33,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:47:33,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:47:33,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:47:33,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:47:33,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:47:33,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:47:33,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:47:33,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:47:33,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:47:33,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:47:33,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:47:33,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:47:33,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:47:33,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:47:33,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:47:33,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:47:33,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:47:33,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:47:33,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:47:33,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:47:33,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:47:33,852 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:47:33,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:47:33,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:47:33,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:47:33,895 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:47:33,896 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:47:33,896 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:47:33,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:47:33,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:47:33,898 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:47:33,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:47:33,899 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:47:33,899 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:47:33,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:47:33,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:47:33,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:47:33,901 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:47:33,901 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:47:33,901 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:47:33,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:47:33,902 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:47:33,903 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:47:33,903 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:47:33,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:47:33,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:47:33,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:47:33,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:47:33,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:47:33,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:47:33,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:47:33,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:47:33,906 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_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8 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 -> e1d84228246cc640f111b0bf0907a0ec6838e3ee0e70770c8d77ae15dd23f4db [2022-11-16 12:47:34,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:47:34,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:47:34,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:47:34,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:47:34,264 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:47:34,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/rfi008.oepc.i [2022-11-16 12:47:34,352 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/data/84a63e953/bfecf0c60d164850a3e5cd350856ec7f/FLAG2c93d6496 [2022-11-16 12:47:34,913 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:47:34,914 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/sv-benchmarks/c/pthread-wmm/rfi008.oepc.i [2022-11-16 12:47:34,936 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/data/84a63e953/bfecf0c60d164850a3e5cd350856ec7f/FLAG2c93d6496 [2022-11-16 12:47:35,225 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/data/84a63e953/bfecf0c60d164850a3e5cd350856ec7f [2022-11-16 12:47:35,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:47:35,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:47:35,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:47:35,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:47:35,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:47:35,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:47:35" (1/1) ... [2022-11-16 12:47:35,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2070983f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:35, skipping insertion in model container [2022-11-16 12:47:35,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:47:35" (1/1) ... [2022-11-16 12:47:35,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:47:35,297 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:47:35,616 WARN L229 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_2f8cc2dd-b83e-40b9-9e9e-258960f834da/sv-benchmarks/c/pthread-wmm/rfi008.oepc.i[988,1001] [2022-11-16 12:47:35,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:47:35,989 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:47:36,006 WARN L229 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_2f8cc2dd-b83e-40b9-9e9e-258960f834da/sv-benchmarks/c/pthread-wmm/rfi008.oepc.i[988,1001] [2022-11-16 12:47:36,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:47:36,125 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:47:36,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36 WrapperNode [2022-11-16 12:47:36,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:47:36,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:47:36,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:47:36,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:47:36,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36" (1/1) ... [2022-11-16 12:47:36,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36" (1/1) ... [2022-11-16 12:47:36,203 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-11-16 12:47:36,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:47:36,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:47:36,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:47:36,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:47:36,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36" (1/1) ... [2022-11-16 12:47:36,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36" (1/1) ... [2022-11-16 12:47:36,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36" (1/1) ... [2022-11-16 12:47:36,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36" (1/1) ... [2022-11-16 12:47:36,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36" (1/1) ... [2022-11-16 12:47:36,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36" (1/1) ... [2022-11-16 12:47:36,236 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36" (1/1) ... [2022-11-16 12:47:36,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36" (1/1) ... [2022-11-16 12:47:36,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:47:36,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:47:36,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:47:36,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:47:36,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36" (1/1) ... [2022-11-16 12:47:36,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:47:36,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:36,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:47:36,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:47:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:47:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:47:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:47:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:47:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:47:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:47:36,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:47:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:47:36,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:47:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:47:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:47:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:47:36,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:47:36,365 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:47:36,525 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:47:36,528 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:47:37,058 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:47:37,268 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:47:37,268 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:47:37,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:47:37 BoogieIcfgContainer [2022-11-16 12:47:37,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:47:37,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:47:37,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:47:37,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:47:37,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:47:35" (1/3) ... [2022-11-16 12:47:37,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645e2850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:47:37, skipping insertion in model container [2022-11-16 12:47:37,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:36" (2/3) ... [2022-11-16 12:47:37,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645e2850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:47:37, skipping insertion in model container [2022-11-16 12:47:37,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:47:37" (3/3) ... [2022-11-16 12:47:37,286 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.oepc.i [2022-11-16 12:47:37,311 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:47:37,311 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-16 12:47:37,312 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:47:37,406 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:47:37,461 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 12:47:37,477 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 107 transitions, 224 flow [2022-11-16 12:47:37,479 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 107 transitions, 224 flow [2022-11-16 12:47:37,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 224 flow [2022-11-16 12:47:37,536 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-11-16 12:47:37,536 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:47:37,542 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 68 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-11-16 12:47:37,544 INFO L119 LiptonReduction]: Number of co-enabled transitions 1462 [2022-11-16 12:47:43,616 INFO L134 LiptonReduction]: Checked pairs total: 4423 [2022-11-16 12:47:43,616 INFO L136 LiptonReduction]: Total number of compositions: 108 [2022-11-16 12:47:43,628 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 66 flow [2022-11-16 12:47:43,704 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 296 states, 285 states have (on average 2.6736842105263157) internal successors, (762), 295 states have internal predecessors, (762), 0 states have call successors, (0), 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-16 12:47:43,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:47:43,741 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;@4e3a257, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:47:43,743 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-16 12:47:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 285 states have (on average 2.6736842105263157) internal successors, (762), 295 states have internal predecessors, (762), 0 states have call successors, (0), 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-16 12:47:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 12:47:43,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:43,752 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 12:47:43,753 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:47:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash 503, now seen corresponding path program 1 times [2022-11-16 12:47:43,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:43,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146144168] [2022-11-16 12:47:43,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:43,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,932 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-16 12:47:43,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:43,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146144168] [2022-11-16 12:47:43,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146144168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:43,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:43,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 12:47:43,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764676820] [2022-11-16 12:47:43,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:43,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:47:43,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:43,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:47:43,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:47:43,977 INFO L87 Difference]: Start difference. First operand has 296 states, 285 states have (on average 2.6736842105263157) internal successors, (762), 295 states have internal predecessors, (762), 0 states have call successors, (0), 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-16 12:47:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:44,080 INFO L93 Difference]: Finished difference Result 280 states and 692 transitions. [2022-11-16 12:47:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:47:44,083 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-16 12:47:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:44,105 INFO L225 Difference]: With dead ends: 280 [2022-11-16 12:47:44,106 INFO L226 Difference]: Without dead ends: 280 [2022-11-16 12:47:44,107 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-16 12:47:44,112 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:44,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:47:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-16 12:47:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-11-16 12:47:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 2.5163636363636366) internal successors, (692), 279 states have internal predecessors, (692), 0 states have call successors, (0), 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-16 12:47:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 692 transitions. [2022-11-16 12:47:44,202 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 692 transitions. Word has length 1 [2022-11-16 12:47:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:44,202 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 692 transitions. [2022-11-16 12:47:44,207 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-16 12:47:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 692 transitions. [2022-11-16 12:47:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:47:44,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:44,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:47:44,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:47:44,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:47:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:44,212 INFO L85 PathProgramCache]: Analyzing trace with hash 494168, now seen corresponding path program 1 times [2022-11-16 12:47:44,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:44,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360856681] [2022-11-16 12:47:44,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:44,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:44,643 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-16 12:47:44,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:44,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360856681] [2022-11-16 12:47:44,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360856681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:44,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:44,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:47:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871458133] [2022-11-16 12:47:44,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:44,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:47:44,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:44,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:47:44,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:47:44,648 INFO L87 Difference]: Start difference. First operand 280 states and 692 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:44,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:44,733 INFO L93 Difference]: Finished difference Result 236 states and 575 transitions. [2022-11-16 12:47:44,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:47:44,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 12:47:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:44,736 INFO L225 Difference]: With dead ends: 236 [2022-11-16 12:47:44,736 INFO L226 Difference]: Without dead ends: 230 [2022-11-16 12:47:44,736 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-16 12:47:44,737 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:44,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:47:44,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-16 12:47:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-11-16 12:47:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 228 states have (on average 2.473684210526316) internal successors, (564), 229 states have internal predecessors, (564), 0 states have call successors, (0), 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-16 12:47:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 564 transitions. [2022-11-16 12:47:44,751 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 564 transitions. Word has length 3 [2022-11-16 12:47:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:44,752 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 564 transitions. [2022-11-16 12:47:44,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 564 transitions. [2022-11-16 12:47:44,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:47:44,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:44,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:44,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:47:44,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:47:44,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:44,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1166377854, now seen corresponding path program 1 times [2022-11-16 12:47:44,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:44,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24841006] [2022-11-16 12:47:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:44,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:45,134 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-16 12:47:45,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:45,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24841006] [2022-11-16 12:47:45,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24841006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:45,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:45,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:47:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142807310] [2022-11-16 12:47:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:45,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:47:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:45,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:47:45,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:47:45,139 INFO L87 Difference]: Start difference. First operand 230 states and 564 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 12:47:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:45,239 INFO L93 Difference]: Finished difference Result 290 states and 688 transitions. [2022-11-16 12:47:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:47:45,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-16 12:47:45,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:45,243 INFO L225 Difference]: With dead ends: 290 [2022-11-16 12:47:45,243 INFO L226 Difference]: Without dead ends: 290 [2022-11-16 12:47:45,244 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-16 12:47:45,245 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:45,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:47:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-16 12:47:45,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 226. [2022-11-16 12:47:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 224 states have (on average 2.4642857142857144) internal successors, (552), 225 states have internal predecessors, (552), 0 states have call successors, (0), 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-16 12:47:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 552 transitions. [2022-11-16 12:47:45,259 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 552 transitions. Word has length 7 [2022-11-16 12:47:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:45,260 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 552 transitions. [2022-11-16 12:47:45,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 12:47:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 552 transitions. [2022-11-16 12:47:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 12:47:45,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:45,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:45,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:47:45,262 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:47:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1797975842, now seen corresponding path program 1 times [2022-11-16 12:47:45,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:45,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945492796] [2022-11-16 12:47:45,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:45,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:45,677 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-16 12:47:45,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:45,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945492796] [2022-11-16 12:47:45,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945492796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:45,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:45,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:47:45,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594280701] [2022-11-16 12:47:45,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:45,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:47:45,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:45,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:47:45,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:45,693 INFO L87 Difference]: Start difference. First operand 226 states and 552 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-16 12:47:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:45,919 INFO L93 Difference]: Finished difference Result 338 states and 811 transitions. [2022-11-16 12:47:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:47:45,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-16 12:47:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:45,923 INFO L225 Difference]: With dead ends: 338 [2022-11-16 12:47:45,923 INFO L226 Difference]: Without dead ends: 302 [2022-11-16 12:47:45,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:45,924 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:45,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 17 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:47:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-16 12:47:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 278. [2022-11-16 12:47:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 276 states have (on average 2.4528985507246377) internal successors, (677), 277 states have internal predecessors, (677), 0 states have call successors, (0), 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-16 12:47:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 677 transitions. [2022-11-16 12:47:45,943 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 677 transitions. Word has length 8 [2022-11-16 12:47:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:45,944 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 677 transitions. [2022-11-16 12:47:45,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-16 12:47:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 677 transitions. [2022-11-16 12:47:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 12:47:45,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:45,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:45,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:47:45,949 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:47:45,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash 892784728, now seen corresponding path program 1 times [2022-11-16 12:47:45,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:45,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241248757] [2022-11-16 12:47:45,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:45,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:46,269 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-16 12:47:46,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:46,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241248757] [2022-11-16 12:47:46,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241248757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:46,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:46,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:47:46,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706188829] [2022-11-16 12:47:46,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:46,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:47:46,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:46,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:47:46,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:47:46,278 INFO L87 Difference]: Start difference. First operand 278 states and 677 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-16 12:47:46,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:46,408 INFO L93 Difference]: Finished difference Result 302 states and 711 transitions. [2022-11-16 12:47:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:47:46,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-16 12:47:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:46,412 INFO L225 Difference]: With dead ends: 302 [2022-11-16 12:47:46,412 INFO L226 Difference]: Without dead ends: 302 [2022-11-16 12:47:46,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:47:46,413 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:46,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:47:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-16 12:47:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 270. [2022-11-16 12:47:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 268 states have (on average 2.4141791044776117) internal successors, (647), 269 states have internal predecessors, (647), 0 states have call successors, (0), 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-16 12:47:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 647 transitions. [2022-11-16 12:47:46,425 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 647 transitions. Word has length 9 [2022-11-16 12:47:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:46,426 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 647 transitions. [2022-11-16 12:47:46,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-16 12:47:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 647 transitions. [2022-11-16 12:47:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 12:47:46,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:46,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:46,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:47:46,428 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:47:46,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash -146439100, now seen corresponding path program 1 times [2022-11-16 12:47:46,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:46,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095095045] [2022-11-16 12:47:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:46,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:46,586 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-16 12:47:46,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:46,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095095045] [2022-11-16 12:47:46,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095095045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:46,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:46,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:47:46,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667821211] [2022-11-16 12:47:46,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:46,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:47:46,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:46,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:47:46,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:47:46,591 INFO L87 Difference]: Start difference. First operand 270 states and 647 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-16 12:47:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:46,670 INFO L93 Difference]: Finished difference Result 262 states and 625 transitions. [2022-11-16 12:47:46,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:47:46,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-16 12:47:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:46,675 INFO L225 Difference]: With dead ends: 262 [2022-11-16 12:47:46,675 INFO L226 Difference]: Without dead ends: 262 [2022-11-16 12:47:46,675 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-16 12:47:46,678 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:46,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:47:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-16 12:47:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-11-16 12:47:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 260 states have (on average 2.4038461538461537) internal successors, (625), 261 states have internal predecessors, (625), 0 states have call successors, (0), 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-16 12:47:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 625 transitions. [2022-11-16 12:47:46,704 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 625 transitions. Word has length 9 [2022-11-16 12:47:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:46,705 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 625 transitions. [2022-11-16 12:47:46,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-16 12:47:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 625 transitions. [2022-11-16 12:47:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 12:47:46,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:46,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:46,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:47:46,714 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:47:46,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:46,715 INFO L85 PathProgramCache]: Analyzing trace with hash -303771122, now seen corresponding path program 1 times [2022-11-16 12:47:46,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:46,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098916250] [2022-11-16 12:47:46,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:46,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,096 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-16 12:47:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:47,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098916250] [2022-11-16 12:47:47,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098916250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:47,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:47,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:47:47,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752282142] [2022-11-16 12:47:47,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:47,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:47:47,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:47,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:47:47,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:47,100 INFO L87 Difference]: Start difference. First operand 262 states and 625 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-16 12:47:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:47,229 INFO L93 Difference]: Finished difference Result 238 states and 563 transitions. [2022-11-16 12:47:47,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:47:47,229 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-16 12:47:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:47,231 INFO L225 Difference]: With dead ends: 238 [2022-11-16 12:47:47,231 INFO L226 Difference]: Without dead ends: 214 [2022-11-16 12:47:47,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:47,232 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:47,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:47:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-16 12:47:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 138. [2022-11-16 12:47:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.3065693430656933) internal successors, (316), 137 states have internal predecessors, (316), 0 states have call successors, (0), 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-16 12:47:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 316 transitions. [2022-11-16 12:47:47,237 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 316 transitions. Word has length 10 [2022-11-16 12:47:47,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:47,238 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 316 transitions. [2022-11-16 12:47:47,238 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-16 12:47:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 316 transitions. [2022-11-16 12:47:47,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:47:47,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:47,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:47,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:47:47,239 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:47:47,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1748538386, now seen corresponding path program 1 times [2022-11-16 12:47:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:47,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606510762] [2022-11-16 12:47:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:47,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,451 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-16 12:47:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:47,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606510762] [2022-11-16 12:47:47,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606510762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:47,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:47,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:47:47,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942145284] [2022-11-16 12:47:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:47,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:47:47,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:47,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:47:47,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:47:47,453 INFO L87 Difference]: Start difference. First operand 138 states and 316 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:47,571 INFO L93 Difference]: Finished difference Result 115 states and 224 transitions. [2022-11-16 12:47:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:47:47,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 12:47:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:47,573 INFO L225 Difference]: With dead ends: 115 [2022-11-16 12:47:47,573 INFO L226 Difference]: Without dead ends: 79 [2022-11-16 12:47:47,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:47,574 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:47,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:47:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-16 12:47:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-16 12:47:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 78 states have internal predecessors, (139), 0 states have call successors, (0), 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-16 12:47:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2022-11-16 12:47:47,577 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 11 [2022-11-16 12:47:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:47,578 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2022-11-16 12:47:47,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-11-16 12:47:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:47:47,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:47,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:47,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:47:47,579 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:47:47,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:47,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1308507918, now seen corresponding path program 1 times [2022-11-16 12:47:47,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:47,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396922343] [2022-11-16 12:47:47,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:47,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,961 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-16 12:47:47,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:47,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396922343] [2022-11-16 12:47:47,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396922343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:47,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:47,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:47:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319618662] [2022-11-16 12:47:47,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:47,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:47:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:47:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:47,964 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:48,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:48,069 INFO L93 Difference]: Finished difference Result 64 states and 107 transitions. [2022-11-16 12:47:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:47:48,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 12:47:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:48,070 INFO L225 Difference]: With dead ends: 64 [2022-11-16 12:47:48,071 INFO L226 Difference]: Without dead ends: 53 [2022-11-16 12:47:48,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:47:48,071 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:48,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 10 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:47:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-16 12:47:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-16 12:47:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 52 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-16 12:47:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 87 transitions. [2022-11-16 12:47:48,074 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 87 transitions. Word has length 14 [2022-11-16 12:47:48,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:48,074 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 87 transitions. [2022-11-16 12:47:48,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:48,075 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 87 transitions. [2022-11-16 12:47:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:47:48,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:48,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:48,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:47:48,075 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:47:48,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash 842582975, now seen corresponding path program 1 times [2022-11-16 12:47:48,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:48,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494055912] [2022-11-16 12:47:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:48,354 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-16 12:47:48,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:48,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494055912] [2022-11-16 12:47:48,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494055912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:48,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:48,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:47:48,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407098418] [2022-11-16 12:47:48,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:48,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:47:48,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:48,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:47:48,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:47:48,357 INFO L87 Difference]: Start difference. First operand 53 states and 87 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-16 12:47:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:48,448 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-11-16 12:47:48,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:47:48,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-16 12:47:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:48,449 INFO L225 Difference]: With dead ends: 70 [2022-11-16 12:47:48,449 INFO L226 Difference]: Without dead ends: 50 [2022-11-16 12:47:48,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:48,450 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:48,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:47:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-16 12:47:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-11-16 12:47:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 43 states have internal predecessors, (69), 0 states have call successors, (0), 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-16 12:47:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 69 transitions. [2022-11-16 12:47:48,453 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 69 transitions. Word has length 17 [2022-11-16 12:47:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:48,453 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 69 transitions. [2022-11-16 12:47:48,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-16 12:47:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 69 transitions. [2022-11-16 12:47:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:47:48,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:48,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:48,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:47:48,454 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:47:48,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:48,454 INFO L85 PathProgramCache]: Analyzing trace with hash 469836737, now seen corresponding path program 2 times [2022-11-16 12:47:48,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:48,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739347871] [2022-11-16 12:47:48,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:48,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:48,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-16 12:47:48,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:48,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739347871] [2022-11-16 12:47:48,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739347871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:48,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:48,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:47:48,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028407486] [2022-11-16 12:47:48,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:48,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:47:48,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:48,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:47:48,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:48,827 INFO L87 Difference]: Start difference. First operand 44 states and 69 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-16 12:47:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:48,956 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2022-11-16 12:47:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:47:48,957 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-16 12:47:48,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:48,958 INFO L225 Difference]: With dead ends: 61 [2022-11-16 12:47:48,958 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 12:47:48,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:47:48,959 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:48,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:47:48,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 12:47:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-16 12:47:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 37 states have internal predecessors, (57), 0 states have call successors, (0), 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-16 12:47:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 57 transitions. [2022-11-16 12:47:48,963 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 57 transitions. Word has length 17 [2022-11-16 12:47:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:48,963 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 57 transitions. [2022-11-16 12:47:48,963 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-16 12:47:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2022-11-16 12:47:48,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:47:48,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:48,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:48,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:47:48,965 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:47:48,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1696209407, now seen corresponding path program 3 times [2022-11-16 12:47:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:48,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208688363] [2022-11-16 12:47:48,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:47:49,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:47:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:47:49,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:47:49,200 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:47:49,201 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-16 12:47:49,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-16 12:47:49,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-16 12:47:49,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-16 12:47:49,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-16 12:47:49,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-16 12:47:49,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-16 12:47:49,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-16 12:47:49,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-16 12:47:49,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-16 12:47:49,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:47:49,210 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:49,217 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:47:49,217 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:47:49,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:47:49 BasicIcfg [2022-11-16 12:47:49,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:47:49,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:47:49,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:47:49,330 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:47:49,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:47:37" (3/4) ... [2022-11-16 12:47:49,334 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:47:49,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:47:49,335 INFO L158 Benchmark]: Toolchain (without parser) took 14105.57ms. Allocated memory was 98.6MB in the beginning and 237.0MB in the end (delta: 138.4MB). Free memory was 75.0MB in the beginning and 140.3MB in the end (delta: -65.3MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2022-11-16 12:47:49,335 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 98.6MB. Free memory was 70.6MB in the beginning and 70.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:47:49,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 893.39ms. Allocated memory is still 98.6MB. Free memory was 74.7MB in the beginning and 59.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-16 12:47:49,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.57ms. Allocated memory is still 98.6MB. Free memory was 59.2MB in the beginning and 56.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:47:49,336 INFO L158 Benchmark]: Boogie Preprocessor took 37.86ms. Allocated memory is still 98.6MB. Free memory was 56.4MB in the beginning and 54.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:47:49,338 INFO L158 Benchmark]: RCFGBuilder took 1028.19ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 54.6MB in the beginning and 83.1MB in the end (delta: -28.5MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2022-11-16 12:47:49,339 INFO L158 Benchmark]: TraceAbstraction took 12052.43ms. Allocated memory was 127.9MB in the beginning and 237.0MB in the end (delta: 109.1MB). Free memory was 82.5MB in the beginning and 140.3MB in the end (delta: -57.8MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2022-11-16 12:47:49,339 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 237.0MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:47:49,342 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 98.6MB. Free memory was 70.6MB in the beginning and 70.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 893.39ms. Allocated memory is still 98.6MB. Free memory was 74.7MB in the beginning and 59.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.57ms. Allocated memory is still 98.6MB. Free memory was 59.2MB in the beginning and 56.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.86ms. Allocated memory is still 98.6MB. Free memory was 56.4MB in the beginning and 54.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1028.19ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 54.6MB in the beginning and 83.1MB in the end (delta: -28.5MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12052.43ms. Allocated memory was 127.9MB in the beginning and 237.0MB in the end (delta: 109.1MB). Free memory was 82.5MB in the beginning and 140.3MB in the end (delta: -57.8MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 237.0MB. Free memory is still 140.3MB. 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: 6.1s, 112 PlacesBefore, 34 PlacesAfterwards, 107 TransitionsBefore, 28 TransitionsAfterwards, 1462 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 4423 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2087, independent: 1921, independent conditional: 0, independent unconditional: 1921, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1083, independent: 1030, independent conditional: 0, independent unconditional: 1030, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1083, independent: 1014, independent conditional: 0, independent unconditional: 1014, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 633, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 606, dependent conditional: 0, dependent unconditional: 606, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2087, independent: 891, independent conditional: 0, independent unconditional: 891, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 1083, unknown conditional: 0, unknown unconditional: 1083] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L722] 0 _Bool x$flush_delayed; [L731] 0 int *x$read_delayed_var; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L723] 0 int x$mem_tmp; [L711] 0 int __unbuffered_p0_EAX = 0; [L725] 0 _Bool x$r_buff0_thd1; [L715] 0 int __unbuffered_p1_EAX = 0; [L726] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$read_delayed; [L709] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L719] 0 _Bool main$tmp_guard1; [L735] 0 _Bool x$w_buff1_used; [L718] 0 _Bool main$tmp_guard0; [L717] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff0; [L734] 0 int x$w_buff1; [L721] 0 int x = 0; [L728] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd0; [L737] 0 int y = 0; [L729] 0 _Bool x$r_buff1_thd2; [L831] 0 pthread_t t1721; [L832] FCALL, FORK 0 pthread_create(&t1721, ((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, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1721, ((void *)0), P0, ((void *)0))=-1, t1721={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 1 x$w_buff1 = x$w_buff0 [L744] 1 x$w_buff0 = 1 [L745] 1 x$w_buff1_used = x$w_buff0_used [L746] 1 x$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L748] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 1 x$r_buff0_thd1 = (_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1722; [L834] FCALL, FORK 0 pthread_create(&t1722, ((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(&t1722, ((void *)0), P1, ((void *)0))=0, t1721={5:0}, t1722={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 x$flush_delayed = weak$$choice2 [L757] 1 x$mem_tmp = x [L758] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L759] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L760] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L761] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L762] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L764] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = x [L766] 1 x = x$flush_delayed ? x$mem_tmp : x [L767] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 2 __unbuffered_p1_EAX = y 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=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 x$flush_delayed = weak$$choice2 [L796] 2 x$mem_tmp = x [L797] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L798] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L799] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L800] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L801] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L803] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = x [L805] 2 x = x$flush_delayed ? x$mem_tmp : x [L806] 2 x$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=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 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=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L773] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L776] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$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, t1721={5:0}, t1722={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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, 127 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 193 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 590 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 31 mSDtfsCounter, 590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=0, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 202 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 703 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-16 12:47:49,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8 --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 e1d84228246cc640f111b0bf0907a0ec6838e3ee0e70770c8d77ae15dd23f4db --- 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-e04fb08 [2022-11-16 12:47:52,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:47:52,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:47:52,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:47:52,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:47:52,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:47:52,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:47:52,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:47:52,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:47:52,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:47:52,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:47:52,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:47:52,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:47:52,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:47:52,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:47:52,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:47:52,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:47:52,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:47:52,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:47:52,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:47:52,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:47:52,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:47:52,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:47:52,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:47:52,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:47:52,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:47:52,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:47:52,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:47:52,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:47:52,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:47:52,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:47:52,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:47:52,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:47:52,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:47:52,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:47:52,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:47:52,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:47:52,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:47:52,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:47:52,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:47:52,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:47:52,134 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 12:47:52,200 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:47:52,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:47:52,201 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:47:52,202 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:47:52,203 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:47:52,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:47:52,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:47:52,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:47:52,206 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:47:52,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:47:52,208 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:47:52,208 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:47:52,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:47:52,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:47:52,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:47:52,209 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:47:52,209 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:47:52,209 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:47:52,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:47:52,210 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:47:52,210 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:47:52,210 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:47:52,211 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:47:52,211 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:47:52,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:47:52,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:47:52,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:47:52,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:47:52,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:47:52,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:47:52,213 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:47:52,213 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:47:52,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:47:52,214 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_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8 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 -> e1d84228246cc640f111b0bf0907a0ec6838e3ee0e70770c8d77ae15dd23f4db [2022-11-16 12:47:52,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:47:52,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:47:52,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:47:52,652 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:47:52,655 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:47:52,657 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/rfi008.oepc.i [2022-11-16 12:47:52,721 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/data/f8f018325/7ac6bca7c71d4fd6a4c4716e9b1b26a3/FLAGbba23fd4a [2022-11-16 12:47:53,389 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:47:53,390 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/sv-benchmarks/c/pthread-wmm/rfi008.oepc.i [2022-11-16 12:47:53,405 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/data/f8f018325/7ac6bca7c71d4fd6a4c4716e9b1b26a3/FLAGbba23fd4a [2022-11-16 12:47:53,636 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/data/f8f018325/7ac6bca7c71d4fd6a4c4716e9b1b26a3 [2022-11-16 12:47:53,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:47:53,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:47:53,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:47:53,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:47:53,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:47:53,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:47:53" (1/1) ... [2022-11-16 12:47:53,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dce4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:53, skipping insertion in model container [2022-11-16 12:47:53,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:47:53" (1/1) ... [2022-11-16 12:47:53,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:47:53,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:47:54,045 WARN L229 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_2f8cc2dd-b83e-40b9-9e9e-258960f834da/sv-benchmarks/c/pthread-wmm/rfi008.oepc.i[988,1001] [2022-11-16 12:47:54,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:47:54,402 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:47:54,421 WARN L229 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_2f8cc2dd-b83e-40b9-9e9e-258960f834da/sv-benchmarks/c/pthread-wmm/rfi008.oepc.i[988,1001] [2022-11-16 12:47:54,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:47:54,545 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:47:54,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54 WrapperNode [2022-11-16 12:47:54,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:47:54,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:47:54,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:47:54,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:47:54,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54" (1/1) ... [2022-11-16 12:47:54,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54" (1/1) ... [2022-11-16 12:47:54,623 INFO L138 Inliner]: procedures = 178, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2022-11-16 12:47:54,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:47:54,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:47:54,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:47:54,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:47:54,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54" (1/1) ... [2022-11-16 12:47:54,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54" (1/1) ... [2022-11-16 12:47:54,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54" (1/1) ... [2022-11-16 12:47:54,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54" (1/1) ... [2022-11-16 12:47:54,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54" (1/1) ... [2022-11-16 12:47:54,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54" (1/1) ... [2022-11-16 12:47:54,659 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54" (1/1) ... [2022-11-16 12:47:54,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54" (1/1) ... [2022-11-16 12:47:54,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:47:54,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:47:54,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:47:54,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:47:54,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54" (1/1) ... [2022-11-16 12:47:54,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:47:54,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:54,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:47:54,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:47:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:47:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:47:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:47:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:47:54,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:47:54,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:47:54,811 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:47:54,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:47:54,814 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:47:54,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:47:54,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:47:54,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:47:54,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:47:54,817 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:47:55,084 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:47:55,087 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:47:55,742 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:47:55,958 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:47:55,958 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:47:55,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:47:55 BoogieIcfgContainer [2022-11-16 12:47:55,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:47:55,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:47:55,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:47:55,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:47:55,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:47:53" (1/3) ... [2022-11-16 12:47:55,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f931fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:47:55, skipping insertion in model container [2022-11-16 12:47:55,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:54" (2/3) ... [2022-11-16 12:47:55,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f931fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:47:55, skipping insertion in model container [2022-11-16 12:47:55,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:47:55" (3/3) ... [2022-11-16 12:47:55,974 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.oepc.i [2022-11-16 12:47:56,003 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:47:56,003 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-16 12:47:56,004 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:47:56,082 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:47:56,135 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 12:47:56,153 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 108 transitions, 226 flow [2022-11-16 12:47:56,156 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 108 transitions, 226 flow [2022-11-16 12:47:56,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 108 transitions, 226 flow [2022-11-16 12:47:56,251 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-11-16 12:47:56,251 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:47:56,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-11-16 12:47:56,264 INFO L119 LiptonReduction]: Number of co-enabled transitions 1462 [2022-11-16 12:48:05,433 INFO L134 LiptonReduction]: Checked pairs total: 4368 [2022-11-16 12:48:05,433 INFO L136 LiptonReduction]: Total number of compositions: 106 [2022-11-16 12:48:05,444 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 66 flow [2022-11-16 12:48:05,492 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 296 states, 285 states have (on average 2.6736842105263157) internal successors, (762), 295 states have internal predecessors, (762), 0 states have call successors, (0), 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-16 12:48:05,514 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:48:05,522 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;@1a3c27db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:48:05,522 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-16 12:48:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 285 states have (on average 2.6736842105263157) internal successors, (762), 295 states have internal predecessors, (762), 0 states have call successors, (0), 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-16 12:48:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 12:48:05,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:05,533 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 12:48:05,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:48:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:05,540 INFO L85 PathProgramCache]: Analyzing trace with hash 502, now seen corresponding path program 1 times [2022-11-16 12:48:05,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:48:05,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058162918] [2022-11-16 12:48:05,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:05,556 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-16 12:48:05,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:48:05,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:05,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:05,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 12:48:05,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:05,702 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-16 12:48:05,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:05,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:48:05,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058162918] [2022-11-16 12:48:05,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058162918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:05,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:05,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 12:48:05,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719736276] [2022-11-16 12:48:05,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:05,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:48:05,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:48:05,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:48:05,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:48:05,754 INFO L87 Difference]: Start difference. First operand has 296 states, 285 states have (on average 2.6736842105263157) internal successors, (762), 295 states have internal predecessors, (762), 0 states have call successors, (0), 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-16 12:48:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:05,859 INFO L93 Difference]: Finished difference Result 280 states and 692 transitions. [2022-11-16 12:48:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:48:05,862 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-16 12:48:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:05,876 INFO L225 Difference]: With dead ends: 280 [2022-11-16 12:48:05,877 INFO L226 Difference]: Without dead ends: 280 [2022-11-16 12:48:05,878 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-16 12:48:05,882 INFO L413 NwaCegarLoop]: 3 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, 3 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-16 12:48:05,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:48:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-16 12:48:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-11-16 12:48:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 2.5163636363636366) internal successors, (692), 279 states have internal predecessors, (692), 0 states have call successors, (0), 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-16 12:48:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 692 transitions. [2022-11-16 12:48:06,079 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 692 transitions. Word has length 1 [2022-11-16 12:48:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:06,080 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 692 transitions. [2022-11-16 12:48:06,080 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-16 12:48:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 692 transitions. [2022-11-16 12:48:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:48:06,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:06,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:48:06,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:06,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:06,295 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:48:06,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash 495194, now seen corresponding path program 1 times [2022-11-16 12:48:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:48:06,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963020758] [2022-11-16 12:48:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:06,298 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-16 12:48:06,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:48:06,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:06,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:48:06,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:06,429 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-16 12:48:06,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:06,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:48:06,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963020758] [2022-11-16 12:48:06,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963020758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:06,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:06,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:48:06,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656062857] [2022-11-16 12:48:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:06,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:06,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:48:06,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:06,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:48:06,447 INFO L87 Difference]: Start difference. First operand 280 states and 692 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:48:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:06,584 INFO L93 Difference]: Finished difference Result 236 states and 575 transitions. [2022-11-16 12:48:06,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:06,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 12:48:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:06,589 INFO L225 Difference]: With dead ends: 236 [2022-11-16 12:48:06,589 INFO L226 Difference]: Without dead ends: 230 [2022-11-16 12:48:06,590 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-16 12:48:06,591 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:06,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:48:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-16 12:48:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-11-16 12:48:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 228 states have (on average 2.473684210526316) internal successors, (564), 229 states have internal predecessors, (564), 0 states have call successors, (0), 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-16 12:48:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 564 transitions. [2022-11-16 12:48:06,623 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 564 transitions. Word has length 3 [2022-11-16 12:48:06,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:06,623 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 564 transitions. [2022-11-16 12:48:06,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:48:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 564 transitions. [2022-11-16 12:48:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:48:06,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:06,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:06,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:06,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:06,839 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:48:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:06,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2106575118, now seen corresponding path program 1 times [2022-11-16 12:48:06,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:48:06,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685044297] [2022-11-16 12:48:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:06,841 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-16 12:48:06,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:48:06,846 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:06,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:48:06,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:07,057 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-16 12:48:07,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:07,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:48:07,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685044297] [2022-11-16 12:48:07,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685044297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:07,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:07,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:48:07,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113741449] [2022-11-16 12:48:07,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:07,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:48:07,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:48:07,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:48:07,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:48:07,065 INFO L87 Difference]: Start difference. First operand 230 states and 564 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 12:48:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:07,252 INFO L93 Difference]: Finished difference Result 141 states and 274 transitions. [2022-11-16 12:48:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:48:07,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-16 12:48:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:07,254 INFO L225 Difference]: With dead ends: 141 [2022-11-16 12:48:07,254 INFO L226 Difference]: Without dead ends: 105 [2022-11-16 12:48:07,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-16 12:48:07,256 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:07,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 13 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:48:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-16 12:48:07,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-11-16 12:48:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.8349514563106797) internal successors, (189), 104 states have internal predecessors, (189), 0 states have call successors, (0), 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-16 12:48:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 189 transitions. [2022-11-16 12:48:07,268 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 189 transitions. Word has length 7 [2022-11-16 12:48:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:07,269 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 189 transitions. [2022-11-16 12:48:07,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 12:48:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 189 transitions. [2022-11-16 12:48:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 12:48:07,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:07,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:07,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:07,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:07,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:48:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:07,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1919515068, now seen corresponding path program 1 times [2022-11-16 12:48:07,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:48:07,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866893460] [2022-11-16 12:48:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:07,497 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-16 12:48:07,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:48:07,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:07,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:07,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:48:07,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:07,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:07,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:48:07,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866893460] [2022-11-16 12:48:07,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866893460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:07,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:07,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:48:07,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060102105] [2022-11-16 12:48:07,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:07,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:48:07,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:48:07,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:48:07,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:48:07,725 INFO L87 Difference]: Start difference. First operand 105 states and 189 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-16 12:48:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:07,927 INFO L93 Difference]: Finished difference Result 66 states and 109 transitions. [2022-11-16 12:48:07,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:48:07,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-16 12:48:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:07,929 INFO L225 Difference]: With dead ends: 66 [2022-11-16 12:48:07,929 INFO L226 Difference]: Without dead ends: 55 [2022-11-16 12:48:07,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:48:07,931 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 25 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:07,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 20 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:48:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-16 12:48:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-16 12:48:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.679245283018868) internal successors, (89), 54 states have internal predecessors, (89), 0 states have call successors, (0), 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-16 12:48:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 89 transitions. [2022-11-16 12:48:07,937 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 89 transitions. Word has length 12 [2022-11-16 12:48:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:07,938 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 89 transitions. [2022-11-16 12:48:07,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-16 12:48:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 89 transitions. [2022-11-16 12:48:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:48:07,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:07,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:07,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:08,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:08,154 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:48:08,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:08,155 INFO L85 PathProgramCache]: Analyzing trace with hash 900551107, now seen corresponding path program 1 times [2022-11-16 12:48:08,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:48:08,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290635009] [2022-11-16 12:48:08,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:08,156 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-16 12:48:08,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:48:08,160 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:08,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:08,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:48:08,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:08,431 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-16 12:48:08,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:08,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:48:08,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290635009] [2022-11-16 12:48:08,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290635009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:08,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:08,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:48:08,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909484820] [2022-11-16 12:48:08,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:08,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:48:08,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:48:08,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:48:08,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:48:08,447 INFO L87 Difference]: Start difference. First operand 55 states and 89 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-16 12:48:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:08,576 INFO L93 Difference]: Finished difference Result 74 states and 115 transitions. [2022-11-16 12:48:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:48:08,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-16 12:48:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:08,578 INFO L225 Difference]: With dead ends: 74 [2022-11-16 12:48:08,578 INFO L226 Difference]: Without dead ends: 74 [2022-11-16 12:48:08,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-16 12:48:08,580 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:08,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:48:08,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-16 12:48:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2022-11-16 12:48:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 71 states have internal predecessors, (114), 0 states have call successors, (0), 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-16 12:48:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 114 transitions. [2022-11-16 12:48:08,589 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 114 transitions. Word has length 17 [2022-11-16 12:48:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:08,590 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 114 transitions. [2022-11-16 12:48:08,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-16 12:48:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 114 transitions. [2022-11-16 12:48:08,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:48:08,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:08,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:08,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:08,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:08,817 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:48:08,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:08,818 INFO L85 PathProgramCache]: Analyzing trace with hash 591262819, now seen corresponding path program 2 times [2022-11-16 12:48:08,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:48:08,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234399670] [2022-11-16 12:48:08,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:48:08,819 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-16 12:48:08,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:48:08,821 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:08,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:08,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:48:08,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:48:08,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 12:48:08,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:09,772 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-16 12:48:09,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:09,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:48:09,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234399670] [2022-11-16 12:48:09,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234399670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:09,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:09,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:48:09,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760406403] [2022-11-16 12:48:09,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:09,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:48:09,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:48:09,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:48:09,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:48:09,776 INFO L87 Difference]: Start difference. First operand 72 states and 114 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) 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-16 12:48:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:10,198 INFO L93 Difference]: Finished difference Result 90 states and 135 transitions. [2022-11-16 12:48:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:48:10,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) 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-16 12:48:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:10,200 INFO L225 Difference]: With dead ends: 90 [2022-11-16 12:48:10,200 INFO L226 Difference]: Without dead ends: 90 [2022-11-16 12:48:10,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:48:10,201 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:10,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 27 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:48:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-16 12:48:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2022-11-16 12:48:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 67 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 12:48:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 108 transitions. [2022-11-16 12:48:10,208 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 108 transitions. Word has length 17 [2022-11-16 12:48:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:10,209 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 108 transitions. [2022-11-16 12:48:10,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) 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-16 12:48:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 108 transitions. [2022-11-16 12:48:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:48:10,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:10,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:10,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:10,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:10,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:48:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash 306563941, now seen corresponding path program 3 times [2022-11-16 12:48:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:48:10,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106338327] [2022-11-16 12:48:10,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:48:10,428 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-16 12:48:10,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:48:10,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:10,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:10,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 12:48:10,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 12:48:10,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:48:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:48:10,763 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 12:48:10,763 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:48:10,765 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-16 12:48:10,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-16 12:48:10,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-16 12:48:10,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-16 12:48:10,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-16 12:48:10,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-16 12:48:10,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-16 12:48:10,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-16 12:48:10,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-16 12:48:10,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-16 12:48:10,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:10,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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-16 12:48:10,984 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-11-16 12:48:10,991 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:48:10,992 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:48:11,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:48:11 BasicIcfg [2022-11-16 12:48:11,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:48:11,109 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:48:11,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:48:11,110 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:48:11,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:47:55" (3/4) ... [2022-11-16 12:48:11,114 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:48:11,115 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:48:11,115 INFO L158 Benchmark]: Toolchain (without parser) took 17473.69ms. Allocated memory was 69.2MB in the beginning and 142.6MB in the end (delta: 73.4MB). Free memory was 48.3MB in the beginning and 80.4MB in the end (delta: -32.1MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2022-11-16 12:48:11,116 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 50.4MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:48:11,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 901.87ms. Allocated memory is still 69.2MB. Free memory was 48.1MB in the beginning and 39.3MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:48:11,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.80ms. Allocated memory is still 69.2MB. Free memory was 39.3MB in the beginning and 36.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:48:11,117 INFO L158 Benchmark]: Boogie Preprocessor took 41.60ms. Allocated memory is still 69.2MB. Free memory was 36.7MB in the beginning and 34.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:48:11,118 INFO L158 Benchmark]: RCFGBuilder took 1295.72ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 34.4MB in the beginning and 60.2MB in the end (delta: -25.9MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2022-11-16 12:48:11,119 INFO L158 Benchmark]: TraceAbstraction took 15143.11ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 59.7MB in the beginning and 81.5MB in the end (delta: -21.8MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2022-11-16 12:48:11,119 INFO L158 Benchmark]: Witness Printer took 5.46ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 80.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:48:11,123 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.18ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 50.4MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 901.87ms. Allocated memory is still 69.2MB. Free memory was 48.1MB in the beginning and 39.3MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.80ms. Allocated memory is still 69.2MB. Free memory was 39.3MB in the beginning and 36.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.60ms. Allocated memory is still 69.2MB. Free memory was 36.7MB in the beginning and 34.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1295.72ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 34.4MB in the beginning and 60.2MB in the end (delta: -25.9MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15143.11ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 59.7MB in the beginning and 81.5MB in the end (delta: -21.8MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * Witness Printer took 5.46ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 80.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 113 PlacesBefore, 34 PlacesAfterwards, 108 TransitionsBefore, 28 TransitionsAfterwards, 1462 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 4368 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2090, independent: 1924, independent conditional: 0, independent unconditional: 1924, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1084, independent: 1030, independent conditional: 0, independent unconditional: 1030, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1084, independent: 1014, independent conditional: 0, independent unconditional: 1014, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 635, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 578, dependent conditional: 0, dependent unconditional: 578, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2090, independent: 894, independent conditional: 0, independent unconditional: 894, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 1084, unknown conditional: 0, unknown unconditional: 1084] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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: [L722] 0 _Bool x$flush_delayed; [L731] 0 int *x$read_delayed_var; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L723] 0 int x$mem_tmp; [L711] 0 int __unbuffered_p0_EAX = 0; [L725] 0 _Bool x$r_buff0_thd1; [L715] 0 int __unbuffered_p1_EAX = 0; [L726] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$read_delayed; [L709] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L719] 0 _Bool main$tmp_guard1; [L735] 0 _Bool x$w_buff1_used; [L718] 0 _Bool main$tmp_guard0; [L717] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff0; [L734] 0 int x$w_buff1; [L721] 0 int x = 0; [L728] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd0; [L737] 0 int y = 0; [L729] 0 _Bool x$r_buff1_thd2; [L831] 0 pthread_t t1721; [L832] FCALL, FORK 0 pthread_create(&t1721, ((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, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1721, ((void *)0), P0, ((void *)0))=-1, t1721={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 1 x$w_buff1 = x$w_buff0 [L744] 1 x$w_buff0 = 1 [L745] 1 x$w_buff1_used = x$w_buff0_used [L746] 1 x$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L748] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 1 x$r_buff0_thd1 = (_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1722; [L834] FCALL, FORK 0 pthread_create(&t1722, ((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(&t1722, ((void *)0), P1, ((void *)0))=0, t1721={3:0}, t1722={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 x$flush_delayed = weak$$choice2 [L757] 1 x$mem_tmp = x [L758] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L759] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L760] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L761] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L762] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L764] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = x [L766] 1 x = x$flush_delayed ? x$mem_tmp : x [L767] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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=3, weak$$choice2=2, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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=3, weak$$choice2=2, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=2, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 2 __unbuffered_p1_EAX = y 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=2, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 x$flush_delayed = weak$$choice2 [L796] 2 x$mem_tmp = x [L797] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L798] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L799] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L800] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L801] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L803] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = x [L805] 2 x = x$flush_delayed ? x$mem_tmp : x [L806] 2 x$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=4, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L773] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L776] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$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, t1721={3:0}, t1722={7:0}, weak$$choice0=4, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \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=4, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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, 128 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 411 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 26 mSDtfsCounter, 411 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 297 SizeOfPredicates, 11 NumberOfNonLiveVariables, 562 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-16 12:48:11,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8cc2dd-b83e-40b9-9e9e-258960f834da/bin/uautomizer-tPACEb0tL8/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