./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe025_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe025_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a --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 245f8deca690daafc67ff44dd7680fe4934c4e890117db34905ca3a31fc7577b --- 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-b5237d8 [2022-11-21 13:43:25,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:43:25,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:43:25,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:43:25,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:43:25,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:43:25,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:43:25,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:43:25,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:43:25,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:43:25,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:43:25,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:43:25,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:43:25,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:43:25,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:43:25,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:43:25,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:43:25,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:43:25,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:43:25,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:43:25,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:43:25,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:43:25,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:43:25,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:43:25,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:43:25,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:43:25,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:43:25,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:43:25,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:43:25,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:43:25,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:43:25,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:43:25,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:43:25,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:43:25,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:43:25,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:43:25,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:43:25,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:43:25,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:43:25,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:43:25,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:43:25,608 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 13:43:25,628 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:43:25,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:43:25,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:43:25,628 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:43:25,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:43:25,629 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:43:25,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:43:25,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:43:25,630 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:43:25,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:43:25,631 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:43:25,631 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:43:25,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:43:25,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:43:25,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:43:25,632 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:43:25,632 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:43:25,632 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:43:25,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:43:25,633 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:43:25,633 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:43:25,633 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:43:25,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:43:25,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:43:25,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:43:25,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:43:25,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:43:25,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:43:25,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:43:25,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:43:25,635 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_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a 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 -> 245f8deca690daafc67ff44dd7680fe4934c4e890117db34905ca3a31fc7577b [2022-11-21 13:43:25,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:43:25,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:43:25,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:43:25,959 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:43:25,960 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:43:25,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe025_rmo.i [2022-11-21 13:43:28,836 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:43:29,155 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:43:29,184 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/sv-benchmarks/c/pthread-wmm/safe025_rmo.i [2022-11-21 13:43:29,238 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/data/80d5bd39c/3ae739683b544c41bd3dbdff16425b14/FLAGc46d84db1 [2022-11-21 13:43:29,256 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/data/80d5bd39c/3ae739683b544c41bd3dbdff16425b14 [2022-11-21 13:43:29,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:43:29,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:43:29,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:43:29,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:43:29,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:43:29,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:29,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9da857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29, skipping insertion in model container [2022-11-21 13:43:29,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:29,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:43:29,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:43:29,496 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/sv-benchmarks/c/pthread-wmm/safe025_rmo.i[988,1001] [2022-11-21 13:43:29,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:43:29,741 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:43:29,759 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/sv-benchmarks/c/pthread-wmm/safe025_rmo.i[988,1001] [2022-11-21 13:43:29,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:43:29,902 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:43:29,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29 WrapperNode [2022-11-21 13:43:29,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:43:29,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:43:29,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:43:29,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:43:29,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:29,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:29,968 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-11-21 13:43:29,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:43:29,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:43:29,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:43:29,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:43:29,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:29,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:29,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:29,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:29,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:29,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:29,997 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:29,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:30,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:43:30,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:43:30,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:43:30,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:43:30,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29" (1/1) ... [2022-11-21 13:43:30,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:43:30,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:43:30,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:43:30,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:43:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:43:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:43:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 13:43:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:43:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:43:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:43:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 13:43:30,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 13:43:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 13:43:30,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 13:43:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 13:43:30,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 13:43:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:43:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 13:43:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:43:30,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:43:30,112 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 13:43:30,315 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:43:30,317 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:43:31,055 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:43:31,794 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:43:31,795 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 13:43:31,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:43:31 BoogieIcfgContainer [2022-11-21 13:43:31,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:43:31,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:43:31,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:43:31,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:43:31,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:43:29" (1/3) ... [2022-11-21 13:43:31,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11854e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:43:31, skipping insertion in model container [2022-11-21 13:43:31,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:43:29" (2/3) ... [2022-11-21 13:43:31,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11854e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:43:31, skipping insertion in model container [2022-11-21 13:43:31,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:43:31" (3/3) ... [2022-11-21 13:43:31,813 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_rmo.i [2022-11-21 13:43:31,834 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:43:31,835 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-11-21 13:43:31,835 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 13:43:32,006 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 13:43:32,053 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 13:43:32,073 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 196 transitions, 407 flow [2022-11-21 13:43:32,078 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 196 transitions, 407 flow [2022-11-21 13:43:32,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 196 transitions, 407 flow [2022-11-21 13:43:32,233 INFO L130 PetriNetUnfolder]: 2/193 cut-off events. [2022-11-21 13:43:32,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 13:43:32,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 2/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 350 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-11-21 13:43:32,247 INFO L119 LiptonReduction]: Number of co-enabled transitions 9024 [2022-11-21 13:44:02,786 INFO L134 LiptonReduction]: Checked pairs total: 45004 [2022-11-21 13:44:02,786 INFO L136 LiptonReduction]: Total number of compositions: 200 [2022-11-21 13:44:02,794 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 100 places, 91 transitions, 197 flow [2022-11-21 13:44:06,429 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 119052 states, 77022 states have (on average 5.878671029056633) internal successors, (452787), 119051 states have internal predecessors, (452787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:06,505 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:44:06,528 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;@295ce65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:44:06,529 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2022-11-21 13:44:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 119052 states, 77022 states have (on average 5.878671029056633) internal successors, (452787), 119051 states have internal predecessors, (452787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 13:44:06,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:06,696 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 13:44:06,697 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:06,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1233, now seen corresponding path program 1 times [2022-11-21 13:44:06,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:06,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838917891] [2022-11-21 13:44:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:06,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:06,866 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-21 13:44:06,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:06,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838917891] [2022-11-21 13:44:06,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838917891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:06,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:06,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 13:44:06,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945367006] [2022-11-21 13:44:06,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:06,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:44:06,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:06,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:44:06,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:44:07,217 INFO L87 Difference]: Start difference. First operand has 119052 states, 77022 states have (on average 5.878671029056633) internal successors, (452787), 119051 states have internal predecessors, (452787), 0 states have call successors, (0), 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-21 13:44:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:07,811 INFO L93 Difference]: Finished difference Result 14832 states and 53255 transitions. [2022-11-21 13:44:07,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:44:07,814 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-21 13:44:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:08,025 INFO L225 Difference]: With dead ends: 14832 [2022-11-21 13:44:08,025 INFO L226 Difference]: Without dead ends: 14832 [2022-11-21 13:44:08,026 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-21 13:44:08,029 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:08,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:44:08,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14832 states. [2022-11-21 13:44:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14832 to 14832. [2022-11-21 13:44:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14832 states, 12754 states have (on average 4.175552767759134) internal successors, (53255), 14831 states have internal predecessors, (53255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14832 states to 14832 states and 53255 transitions. [2022-11-21 13:44:08,830 INFO L78 Accepts]: Start accepts. Automaton has 14832 states and 53255 transitions. Word has length 1 [2022-11-21 13:44:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:08,830 INFO L495 AbstractCegarLoop]: Abstraction has 14832 states and 53255 transitions. [2022-11-21 13:44:08,830 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-21 13:44:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 14832 states and 53255 transitions. [2022-11-21 13:44:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 13:44:08,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:08,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 13:44:08,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:44:08,832 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:08,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:08,832 INFO L85 PathProgramCache]: Analyzing trace with hash 37700913, now seen corresponding path program 1 times [2022-11-21 13:44:08,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:08,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759472219] [2022-11-21 13:44:08,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:08,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:09,109 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-21 13:44:09,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:09,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759472219] [2022-11-21 13:44:09,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759472219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:09,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:09,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:44:09,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607339852] [2022-11-21 13:44:09,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:09,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:44:09,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:09,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:44:09,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:44:09,116 INFO L87 Difference]: Start difference. First operand 14832 states and 53255 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:09,561 INFO L93 Difference]: Finished difference Result 10120 states and 32966 transitions. [2022-11-21 13:44:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:44:09,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-21 13:44:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:09,615 INFO L225 Difference]: With dead ends: 10120 [2022-11-21 13:44:09,615 INFO L226 Difference]: Without dead ends: 10116 [2022-11-21 13:44:09,622 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-21 13:44:09,623 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:09,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 4 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:44:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2022-11-21 13:44:09,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 9004. [2022-11-21 13:44:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9004 states, 8387 states have (on average 3.75843567425778) internal successors, (31522), 9003 states have internal predecessors, (31522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9004 states to 9004 states and 31522 transitions. [2022-11-21 13:44:10,103 INFO L78 Accepts]: Start accepts. Automaton has 9004 states and 31522 transitions. Word has length 4 [2022-11-21 13:44:10,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:10,104 INFO L495 AbstractCegarLoop]: Abstraction has 9004 states and 31522 transitions. [2022-11-21 13:44:10,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 9004 states and 31522 transitions. [2022-11-21 13:44:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 13:44:10,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:10,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 13:44:10,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:44:10,106 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:10,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:10,107 INFO L85 PathProgramCache]: Analyzing trace with hash 37700914, now seen corresponding path program 1 times [2022-11-21 13:44:10,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:10,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940379515] [2022-11-21 13:44:10,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:10,319 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-21 13:44:10,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:10,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940379515] [2022-11-21 13:44:10,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940379515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:10,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:10,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:44:10,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279831271] [2022-11-21 13:44:10,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:10,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:44:10,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:10,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:44:10,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:44:10,322 INFO L87 Difference]: Start difference. First operand 9004 states and 31522 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:10,484 INFO L93 Difference]: Finished difference Result 3090 states and 9603 transitions. [2022-11-21 13:44:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:44:10,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-21 13:44:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:10,500 INFO L225 Difference]: With dead ends: 3090 [2022-11-21 13:44:10,500 INFO L226 Difference]: Without dead ends: 3004 [2022-11-21 13:44:10,501 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-21 13:44:10,502 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:10,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:44:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2022-11-21 13:44:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 3004. [2022-11-21 13:44:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 2922 states have (on average 3.1830937713894594) internal successors, (9301), 3003 states have internal predecessors, (9301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 9301 transitions. [2022-11-21 13:44:10,617 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 9301 transitions. Word has length 4 [2022-11-21 13:44:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:10,617 INFO L495 AbstractCegarLoop]: Abstraction has 3004 states and 9301 transitions. [2022-11-21 13:44:10,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 9301 transitions. [2022-11-21 13:44:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 13:44:10,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:10,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:10,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:44:10,621 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:10,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:10,622 INFO L85 PathProgramCache]: Analyzing trace with hash 621542494, now seen corresponding path program 1 times [2022-11-21 13:44:10,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:10,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409806162] [2022-11-21 13:44:10,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:10,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:11,456 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-21 13:44:11,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:11,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409806162] [2022-11-21 13:44:11,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409806162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:11,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:11,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:44:11,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507923628] [2022-11-21 13:44:11,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:11,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:44:11,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:11,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:44:11,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:44:11,459 INFO L87 Difference]: Start difference. First operand 3004 states and 9301 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-21 13:44:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:11,628 INFO L93 Difference]: Finished difference Result 2944 states and 9088 transitions. [2022-11-21 13:44:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:44:11,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-21 13:44:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:11,640 INFO L225 Difference]: With dead ends: 2944 [2022-11-21 13:44:11,640 INFO L226 Difference]: Without dead ends: 2944 [2022-11-21 13:44:11,641 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-21 13:44:11,642 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:11,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:44:11,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2022-11-21 13:44:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2944. [2022-11-21 13:44:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2862 states have (on average 3.175401816911251) internal successors, (9088), 2943 states have internal predecessors, (9088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 9088 transitions. [2022-11-21 13:44:11,719 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 9088 transitions. Word has length 11 [2022-11-21 13:44:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:11,720 INFO L495 AbstractCegarLoop]: Abstraction has 2944 states and 9088 transitions. [2022-11-21 13:44:11,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-21 13:44:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 9088 transitions. [2022-11-21 13:44:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 13:44:11,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:11,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:11,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:44:11,722 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:11,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2087946213, now seen corresponding path program 1 times [2022-11-21 13:44:11,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:11,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906353606] [2022-11-21 13:44:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:14,175 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-21 13:44:14,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:14,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906353606] [2022-11-21 13:44:14,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906353606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:14,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:14,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:44:14,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678100385] [2022-11-21 13:44:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:14,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:44:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:14,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:44:14,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:44:14,177 INFO L87 Difference]: Start difference. First operand 2944 states and 9088 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-21 13:44:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:14,675 INFO L93 Difference]: Finished difference Result 2868 states and 8843 transitions. [2022-11-21 13:44:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:44:14,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-21 13:44:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:14,687 INFO L225 Difference]: With dead ends: 2868 [2022-11-21 13:44:14,687 INFO L226 Difference]: Without dead ends: 2868 [2022-11-21 13:44:14,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:44:14,688 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:14,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 11 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:44:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2022-11-21 13:44:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2868. [2022-11-21 13:44:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2868 states, 2790 states have (on average 3.1695340501792115) internal successors, (8843), 2867 states have internal predecessors, (8843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 8843 transitions. [2022-11-21 13:44:14,760 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 8843 transitions. Word has length 12 [2022-11-21 13:44:14,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:14,760 INFO L495 AbstractCegarLoop]: Abstraction has 2868 states and 8843 transitions. [2022-11-21 13:44:14,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-21 13:44:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 8843 transitions. [2022-11-21 13:44:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 13:44:14,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:14,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:14,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:44:14,762 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:14,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:14,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2087945877, now seen corresponding path program 1 times [2022-11-21 13:44:14,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:14,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720447426] [2022-11-21 13:44:14,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:15,312 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-21 13:44:15,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:15,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720447426] [2022-11-21 13:44:15,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720447426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:15,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:15,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:44:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572649335] [2022-11-21 13:44:15,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:15,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:44:15,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:15,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:44:15,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:44:15,315 INFO L87 Difference]: Start difference. First operand 2868 states and 8843 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-21 13:44:15,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:15,751 INFO L93 Difference]: Finished difference Result 3301 states and 9887 transitions. [2022-11-21 13:44:15,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:44:15,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-21 13:44:15,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:15,765 INFO L225 Difference]: With dead ends: 3301 [2022-11-21 13:44:15,765 INFO L226 Difference]: Without dead ends: 3301 [2022-11-21 13:44:15,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-11-21 13:44:15,766 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 209 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:15,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 3 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:44:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2022-11-21 13:44:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 2788. [2022-11-21 13:44:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2788 states, 2711 states have (on average 3.1645149391368497) internal successors, (8579), 2787 states have internal predecessors, (8579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 8579 transitions. [2022-11-21 13:44:15,909 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 8579 transitions. Word has length 12 [2022-11-21 13:44:15,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:15,909 INFO L495 AbstractCegarLoop]: Abstraction has 2788 states and 8579 transitions. [2022-11-21 13:44:15,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-21 13:44:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 8579 transitions. [2022-11-21 13:44:15,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 13:44:15,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:15,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:15,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 13:44:15,911 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:15,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2087945876, now seen corresponding path program 1 times [2022-11-21 13:44:15,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:15,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982387990] [2022-11-21 13:44:15,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:15,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:16,383 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-21 13:44:16,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:16,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982387990] [2022-11-21 13:44:16,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982387990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:16,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:16,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:44:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036772872] [2022-11-21 13:44:16,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:16,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:44:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:16,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:44:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:44:16,386 INFO L87 Difference]: Start difference. First operand 2788 states and 8579 transitions. Second operand has 5 states, 4 states have (on average 3.0) 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-21 13:44:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:16,691 INFO L93 Difference]: Finished difference Result 3502 states and 10276 transitions. [2022-11-21 13:44:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:44:16,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) 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-21 13:44:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:16,703 INFO L225 Difference]: With dead ends: 3502 [2022-11-21 13:44:16,704 INFO L226 Difference]: Without dead ends: 3502 [2022-11-21 13:44:16,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:44:16,705 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 59 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:16,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 6 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:44:16,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2022-11-21 13:44:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 2524. [2022-11-21 13:44:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2524 states, 2464 states have (on average 3.1400162337662336) internal successors, (7737), 2523 states have internal predecessors, (7737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 7737 transitions. [2022-11-21 13:44:16,773 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 7737 transitions. Word has length 12 [2022-11-21 13:44:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:16,773 INFO L495 AbstractCegarLoop]: Abstraction has 2524 states and 7737 transitions. [2022-11-21 13:44:16,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) 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-21 13:44:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 7737 transitions. [2022-11-21 13:44:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:44:16,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:16,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:16,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:44:16,775 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:16,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:16,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1899871541, now seen corresponding path program 1 times [2022-11-21 13:44:16,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:16,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141284566] [2022-11-21 13:44:16,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:16,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:18,529 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-21 13:44:18,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:18,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141284566] [2022-11-21 13:44:18,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141284566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:18,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:18,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:44:18,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105184562] [2022-11-21 13:44:18,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:18,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:44:18,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:18,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:44:18,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:44:18,532 INFO L87 Difference]: Start difference. First operand 2524 states and 7737 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:19,058 INFO L93 Difference]: Finished difference Result 3619 states and 11207 transitions. [2022-11-21 13:44:19,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:44:19,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 13:44:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:19,069 INFO L225 Difference]: With dead ends: 3619 [2022-11-21 13:44:19,069 INFO L226 Difference]: Without dead ends: 3619 [2022-11-21 13:44:19,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:44:19,070 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 63 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:19,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 20 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 13:44:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2022-11-21 13:44:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 2592. [2022-11-21 13:44:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2532 states have (on average 3.1484992101105846) internal successors, (7972), 2591 states have internal predecessors, (7972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 7972 transitions. [2022-11-21 13:44:19,137 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 7972 transitions. Word has length 13 [2022-11-21 13:44:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:19,137 INFO L495 AbstractCegarLoop]: Abstraction has 2592 states and 7972 transitions. [2022-11-21 13:44:19,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 7972 transitions. [2022-11-21 13:44:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:44:19,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:19,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:19,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 13:44:19,139 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:19,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:19,139 INFO L85 PathProgramCache]: Analyzing trace with hash -50384105, now seen corresponding path program 2 times [2022-11-21 13:44:19,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:19,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413994613] [2022-11-21 13:44:19,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:19,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:20,868 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-21 13:44:20,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:20,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413994613] [2022-11-21 13:44:20,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413994613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:20,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:20,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:44:20,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484689035] [2022-11-21 13:44:20,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:20,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:44:20,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:20,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:44:20,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:44:20,870 INFO L87 Difference]: Start difference. First operand 2592 states and 7972 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:21,671 INFO L93 Difference]: Finished difference Result 3094 states and 9470 transitions. [2022-11-21 13:44:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:44:21,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 13:44:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:21,679 INFO L225 Difference]: With dead ends: 3094 [2022-11-21 13:44:21,679 INFO L226 Difference]: Without dead ends: 3094 [2022-11-21 13:44:21,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-11-21 13:44:21,680 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 138 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:21,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 20 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:44:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-11-21 13:44:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 2508. [2022-11-21 13:44:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2508 states, 2448 states have (on average 3.1376633986928106) internal successors, (7681), 2507 states have internal predecessors, (7681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 7681 transitions. [2022-11-21 13:44:21,743 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 7681 transitions. Word has length 13 [2022-11-21 13:44:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:21,744 INFO L495 AbstractCegarLoop]: Abstraction has 2508 states and 7681 transitions. [2022-11-21 13:44:21,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 7681 transitions. [2022-11-21 13:44:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:44:21,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:21,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:21,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 13:44:21,746 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:21,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:21,746 INFO L85 PathProgramCache]: Analyzing trace with hash 301925250, now seen corresponding path program 1 times [2022-11-21 13:44:21,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:21,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816239514] [2022-11-21 13:44:21,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:21,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:21,977 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-21 13:44:21,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:21,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816239514] [2022-11-21 13:44:21,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816239514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:21,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:21,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:44:21,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778522973] [2022-11-21 13:44:21,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:21,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:44:21,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:21,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:44:21,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:44:21,980 INFO L87 Difference]: Start difference. First operand 2508 states and 7681 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:22,157 INFO L93 Difference]: Finished difference Result 2451 states and 7266 transitions. [2022-11-21 13:44:22,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:44:22,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 13:44:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:22,164 INFO L225 Difference]: With dead ends: 2451 [2022-11-21 13:44:22,164 INFO L226 Difference]: Without dead ends: 2451 [2022-11-21 13:44:22,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:44:22,165 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:22,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 5 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:44:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2022-11-21 13:44:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2177. [2022-11-21 13:44:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 2117 states have (on average 3.1171469059990553) internal successors, (6599), 2176 states have internal predecessors, (6599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 6599 transitions. [2022-11-21 13:44:22,224 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 6599 transitions. Word has length 13 [2022-11-21 13:44:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:22,224 INFO L495 AbstractCegarLoop]: Abstraction has 2177 states and 6599 transitions. [2022-11-21 13:44:22,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:22,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 6599 transitions. [2022-11-21 13:44:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:44:22,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:22,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:22,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 13:44:22,226 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:22,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:22,227 INFO L85 PathProgramCache]: Analyzing trace with hash 747217600, now seen corresponding path program 1 times [2022-11-21 13:44:22,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:22,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326993001] [2022-11-21 13:44:22,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:22,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:22,506 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-21 13:44:22,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:22,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326993001] [2022-11-21 13:44:22,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326993001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:22,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:22,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:44:22,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363389049] [2022-11-21 13:44:22,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:22,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:44:22,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:22,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:44:22,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:44:22,509 INFO L87 Difference]: Start difference. First operand 2177 states and 6599 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-21 13:44:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:22,627 INFO L93 Difference]: Finished difference Result 942 states and 2390 transitions. [2022-11-21 13:44:22,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:44:22,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-21 13:44:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:22,630 INFO L225 Difference]: With dead ends: 942 [2022-11-21 13:44:22,630 INFO L226 Difference]: Without dead ends: 942 [2022-11-21 13:44:22,630 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-21 13:44:22,630 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:22,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:44:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2022-11-21 13:44:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2022-11-21 13:44:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 898 states have (on average 2.661469933184855) internal successors, (2390), 941 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2390 transitions. [2022-11-21 13:44:22,649 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 2390 transitions. Word has length 14 [2022-11-21 13:44:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:22,650 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 2390 transitions. [2022-11-21 13:44:22,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-21 13:44:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 2390 transitions. [2022-11-21 13:44:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 13:44:22,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:22,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:22,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 13:44:22,651 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash 867006746, now seen corresponding path program 1 times [2022-11-21 13:44:22,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:22,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747414061] [2022-11-21 13:44:22,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:22,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:22,945 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-21 13:44:22,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:22,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747414061] [2022-11-21 13:44:22,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747414061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:22,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:22,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:44:22,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928952146] [2022-11-21 13:44:22,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:22,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:44:22,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:22,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:44:22,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:44:22,947 INFO L87 Difference]: Start difference. First operand 942 states and 2390 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:23,099 INFO L93 Difference]: Finished difference Result 296 states and 635 transitions. [2022-11-21 13:44:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:44:23,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 13:44:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:23,101 INFO L225 Difference]: With dead ends: 296 [2022-11-21 13:44:23,102 INFO L226 Difference]: Without dead ends: 296 [2022-11-21 13:44:23,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:44:23,102 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:23,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 15 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:44:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-21 13:44:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-11-21 13:44:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 280 states have (on average 2.267857142857143) internal successors, (635), 295 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 635 transitions. [2022-11-21 13:44:23,112 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 635 transitions. Word has length 16 [2022-11-21 13:44:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:23,112 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 635 transitions. [2022-11-21 13:44:23,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:23,113 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 635 transitions. [2022-11-21 13:44:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:44:23,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:23,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:23,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 13:44:23,114 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:23,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:23,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1491932079, now seen corresponding path program 1 times [2022-11-21 13:44:23,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:23,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702227043] [2022-11-21 13:44:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:23,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:25,506 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-21 13:44:25,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:25,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702227043] [2022-11-21 13:44:25,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702227043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:25,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:25,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:44:25,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244159940] [2022-11-21 13:44:25,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:25,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:44:25,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:25,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:44:25,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:44:25,509 INFO L87 Difference]: Start difference. First operand 296 states and 635 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:25,954 INFO L93 Difference]: Finished difference Result 555 states and 1168 transitions. [2022-11-21 13:44:25,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:44:25,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:44:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:25,956 INFO L225 Difference]: With dead ends: 555 [2022-11-21 13:44:25,956 INFO L226 Difference]: Without dead ends: 555 [2022-11-21 13:44:25,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:44:25,957 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 100 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:25,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 19 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:44:25,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-11-21 13:44:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 395. [2022-11-21 13:44:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 381 states have (on average 2.2624671916010497) internal successors, (862), 394 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 862 transitions. [2022-11-21 13:44:25,969 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 862 transitions. Word has length 19 [2022-11-21 13:44:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:25,969 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 862 transitions. [2022-11-21 13:44:25,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 862 transitions. [2022-11-21 13:44:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:44:25,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:25,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:25,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 13:44:25,971 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1604048089, now seen corresponding path program 2 times [2022-11-21 13:44:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:25,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842599941] [2022-11-21 13:44:25,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:27,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-21 13:44:27,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:27,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842599941] [2022-11-21 13:44:27,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842599941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:27,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:27,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:44:27,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597421275] [2022-11-21 13:44:27,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:27,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:44:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:27,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:44:27,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:44:27,775 INFO L87 Difference]: Start difference. First operand 395 states and 862 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:28,009 INFO L93 Difference]: Finished difference Result 608 states and 1286 transitions. [2022-11-21 13:44:28,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:44:28,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:44:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:28,011 INFO L225 Difference]: With dead ends: 608 [2022-11-21 13:44:28,011 INFO L226 Difference]: Without dead ends: 608 [2022-11-21 13:44:28,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:44:28,012 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:28,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 11 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:44:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-11-21 13:44:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 403. [2022-11-21 13:44:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 389 states have (on average 2.2596401028277633) internal successors, (879), 402 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 879 transitions. [2022-11-21 13:44:28,024 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 879 transitions. Word has length 19 [2022-11-21 13:44:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:28,025 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 879 transitions. [2022-11-21 13:44:28,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 879 transitions. [2022-11-21 13:44:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:44:28,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:28,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:28,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 13:44:28,027 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:28,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash -986971901, now seen corresponding path program 3 times [2022-11-21 13:44:28,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:28,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117999881] [2022-11-21 13:44:28,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:28,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:29,311 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-21 13:44:29,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:29,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117999881] [2022-11-21 13:44:29,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117999881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:29,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:29,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:44:29,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058015154] [2022-11-21 13:44:29,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:29,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:44:29,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:29,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:44:29,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:44:29,313 INFO L87 Difference]: Start difference. First operand 403 states and 879 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:30,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:30,060 INFO L93 Difference]: Finished difference Result 794 states and 1679 transitions. [2022-11-21 13:44:30,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:44:30,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:44:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:30,062 INFO L225 Difference]: With dead ends: 794 [2022-11-21 13:44:30,062 INFO L226 Difference]: Without dead ends: 794 [2022-11-21 13:44:30,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-21 13:44:30,063 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 101 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:30,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 25 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:44:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-11-21 13:44:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 417. [2022-11-21 13:44:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 403 states have (on average 2.2803970223325063) internal successors, (919), 416 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 919 transitions. [2022-11-21 13:44:30,077 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 919 transitions. Word has length 19 [2022-11-21 13:44:30,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:30,078 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 919 transitions. [2022-11-21 13:44:30,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 919 transitions. [2022-11-21 13:44:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:44:30,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:30,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:30,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 13:44:30,080 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:30,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:30,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1919167521, now seen corresponding path program 4 times [2022-11-21 13:44:30,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:30,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130743136] [2022-11-21 13:44:30,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:30,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:30,832 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-21 13:44:30,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:30,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130743136] [2022-11-21 13:44:30,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130743136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:30,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:30,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:44:30,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407795551] [2022-11-21 13:44:30,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:30,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:44:30,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:30,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:44:30,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:44:30,838 INFO L87 Difference]: Start difference. First operand 417 states and 919 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:31,243 INFO L93 Difference]: Finished difference Result 734 states and 1585 transitions. [2022-11-21 13:44:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:44:31,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:44:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:31,245 INFO L225 Difference]: With dead ends: 734 [2022-11-21 13:44:31,245 INFO L226 Difference]: Without dead ends: 734 [2022-11-21 13:44:31,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:44:31,246 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:31,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 20 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:44:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-11-21 13:44:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 447. [2022-11-21 13:44:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 433 states have (on average 2.300230946882217) internal successors, (996), 446 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 996 transitions. [2022-11-21 13:44:31,261 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 996 transitions. Word has length 19 [2022-11-21 13:44:31,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:31,261 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 996 transitions. [2022-11-21 13:44:31,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 996 transitions. [2022-11-21 13:44:31,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:44:31,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:31,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:31,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 13:44:31,264 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1524909979, now seen corresponding path program 5 times [2022-11-21 13:44:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:31,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55731775] [2022-11-21 13:44:31,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:31,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:33,479 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-21 13:44:33,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:33,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55731775] [2022-11-21 13:44:33,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55731775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:33,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:33,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:44:33,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894790277] [2022-11-21 13:44:33,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:33,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:44:33,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:33,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:44:33,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:44:33,482 INFO L87 Difference]: Start difference. First operand 447 states and 996 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:33,801 INFO L93 Difference]: Finished difference Result 841 states and 1779 transitions. [2022-11-21 13:44:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:44:33,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:44:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:33,804 INFO L225 Difference]: With dead ends: 841 [2022-11-21 13:44:33,804 INFO L226 Difference]: Without dead ends: 841 [2022-11-21 13:44:33,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:44:33,805 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 70 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:33,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 13 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:44:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-11-21 13:44:33,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 387. [2022-11-21 13:44:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 373 states have (on average 2.260053619302949) internal successors, (843), 386 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 843 transitions. [2022-11-21 13:44:33,818 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 843 transitions. Word has length 19 [2022-11-21 13:44:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:33,818 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 843 transitions. [2022-11-21 13:44:33,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 843 transitions. [2022-11-21 13:44:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:44:33,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:33,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:33,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 13:44:33,821 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:33,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:33,821 INFO L85 PathProgramCache]: Analyzing trace with hash 698952871, now seen corresponding path program 6 times [2022-11-21 13:44:33,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:33,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454232643] [2022-11-21 13:44:33,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:33,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:35,294 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-21 13:44:35,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:35,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454232643] [2022-11-21 13:44:35,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454232643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:35,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:35,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:44:35,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106239120] [2022-11-21 13:44:35,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:35,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:44:35,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:35,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:44:35,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:44:35,296 INFO L87 Difference]: Start difference. First operand 387 states and 843 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:35,874 INFO L93 Difference]: Finished difference Result 696 states and 1501 transitions. [2022-11-21 13:44:35,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 13:44:35,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:44:35,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:35,875 INFO L225 Difference]: With dead ends: 696 [2022-11-21 13:44:35,875 INFO L226 Difference]: Without dead ends: 696 [2022-11-21 13:44:35,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:44:35,876 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 125 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:35,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 20 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:44:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-11-21 13:44:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 389. [2022-11-21 13:44:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 375 states have (on average 2.264) internal successors, (849), 388 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 849 transitions. [2022-11-21 13:44:35,885 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 849 transitions. Word has length 19 [2022-11-21 13:44:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:35,886 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 849 transitions. [2022-11-21 13:44:35,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 849 transitions. [2022-11-21 13:44:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:44:35,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:35,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:35,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 13:44:35,887 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:35,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:35,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1430222779, now seen corresponding path program 7 times [2022-11-21 13:44:35,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:35,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791490378] [2022-11-21 13:44:35,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:35,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:36,164 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-21 13:44:36,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:36,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791490378] [2022-11-21 13:44:36,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791490378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:36,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:36,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:44:36,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049393924] [2022-11-21 13:44:36,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:36,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:44:36,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:36,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:44:36,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:44:36,167 INFO L87 Difference]: Start difference. First operand 389 states and 849 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:36,303 INFO L93 Difference]: Finished difference Result 261 states and 597 transitions. [2022-11-21 13:44:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:44:36,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:44:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:36,304 INFO L225 Difference]: With dead ends: 261 [2022-11-21 13:44:36,304 INFO L226 Difference]: Without dead ends: 261 [2022-11-21 13:44:36,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:44:36,305 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 43 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:36,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 12 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:44:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-21 13:44:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-11-21 13:44:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 259 states have (on average 2.305019305019305) internal successors, (597), 260 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 597 transitions. [2022-11-21 13:44:36,311 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 597 transitions. Word has length 19 [2022-11-21 13:44:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:36,311 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 597 transitions. [2022-11-21 13:44:36,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 597 transitions. [2022-11-21 13:44:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:44:36,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:36,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:36,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 13:44:36,312 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:36,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:36,313 INFO L85 PathProgramCache]: Analyzing trace with hash 135755646, now seen corresponding path program 1 times [2022-11-21 13:44:36,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:36,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678561304] [2022-11-21 13:44:36,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:36,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:36,597 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-21 13:44:36,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:36,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678561304] [2022-11-21 13:44:36,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678561304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:36,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:36,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:44:36,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970521008] [2022-11-21 13:44:36,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:36,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:44:36,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:36,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:44:36,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:44:36,600 INFO L87 Difference]: Start difference. First operand 261 states and 597 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:36,744 INFO L93 Difference]: Finished difference Result 341 states and 756 transitions. [2022-11-21 13:44:36,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:44:36,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:44:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:36,746 INFO L225 Difference]: With dead ends: 341 [2022-11-21 13:44:36,746 INFO L226 Difference]: Without dead ends: 341 [2022-11-21 13:44:36,746 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-21 13:44:36,747 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:36,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 14 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:44:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-21 13:44:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 226. [2022-11-21 13:44:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 224 states have (on average 2.3035714285714284) internal successors, (516), 225 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 516 transitions. [2022-11-21 13:44:36,752 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 516 transitions. Word has length 22 [2022-11-21 13:44:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:36,753 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 516 transitions. [2022-11-21 13:44:36,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 516 transitions. [2022-11-21 13:44:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:44:36,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:36,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:36,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 13:44:36,754 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:36,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1886493316, now seen corresponding path program 2 times [2022-11-21 13:44:36,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:36,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516415917] [2022-11-21 13:44:36,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:36,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:39,004 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-21 13:44:39,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:39,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516415917] [2022-11-21 13:44:39,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516415917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:39,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:39,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 13:44:39,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920766692] [2022-11-21 13:44:39,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:39,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 13:44:39,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:39,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 13:44:39,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-21 13:44:39,007 INFO L87 Difference]: Start difference. First operand 226 states and 516 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:39,685 INFO L93 Difference]: Finished difference Result 322 states and 707 transitions. [2022-11-21 13:44:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:44:39,686 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:44:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:39,687 INFO L225 Difference]: With dead ends: 322 [2022-11-21 13:44:39,687 INFO L226 Difference]: Without dead ends: 322 [2022-11-21 13:44:39,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2022-11-21 13:44:39,688 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:39,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 12 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:44:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-21 13:44:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 216. [2022-11-21 13:44:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 214 states have (on average 2.2803738317757007) internal successors, (488), 215 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 488 transitions. [2022-11-21 13:44:39,694 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 488 transitions. Word has length 22 [2022-11-21 13:44:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:39,694 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 488 transitions. [2022-11-21 13:44:39,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:44:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 488 transitions. [2022-11-21 13:44:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:44:39,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:39,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:39,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 13:44:39,696 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:44:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1654694932, now seen corresponding path program 3 times [2022-11-21 13:44:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:39,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914629122] [2022-11-21 13:44:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:44:39,790 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:44:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:44:39,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:44:39,941 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 13:44:39,942 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2022-11-21 13:44:39,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2022-11-21 13:44:39,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2022-11-21 13:44:39,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2022-11-21 13:44:39,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2022-11-21 13:44:39,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2022-11-21 13:44:39,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2022-11-21 13:44:39,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2022-11-21 13:44:39,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2022-11-21 13:44:39,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2022-11-21 13:44:39,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2022-11-21 13:44:39,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2022-11-21 13:44:39,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2022-11-21 13:44:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2022-11-21 13:44:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2022-11-21 13:44:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2022-11-21 13:44:39,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2022-11-21 13:44:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2022-11-21 13:44:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2022-11-21 13:44:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2022-11-21 13:44:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2022-11-21 13:44:39,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2022-11-21 13:44:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2022-11-21 13:44:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2022-11-21 13:44:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2022-11-21 13:44:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2022-11-21 13:44:39,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2022-11-21 13:44:39,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2022-11-21 13:44:39,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2022-11-21 13:44:39,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2022-11-21 13:44:39,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2022-11-21 13:44:39,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2022-11-21 13:44:39,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2022-11-21 13:44:39,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2022-11-21 13:44:39,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2022-11-21 13:44:39,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2022-11-21 13:44:39,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2022-11-21 13:44:39,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2022-11-21 13:44:39,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2022-11-21 13:44:39,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2022-11-21 13:44:39,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2022-11-21 13:44:39,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2022-11-21 13:44:39,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2022-11-21 13:44:39,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2022-11-21 13:44:39,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2022-11-21 13:44:39,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2022-11-21 13:44:39,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2022-11-21 13:44:39,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2022-11-21 13:44:39,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2022-11-21 13:44:39,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2022-11-21 13:44:39,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2022-11-21 13:44:39,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2022-11-21 13:44:39,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2022-11-21 13:44:39,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2022-11-21 13:44:39,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2022-11-21 13:44:39,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2022-11-21 13:44:39,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2022-11-21 13:44:39,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2022-11-21 13:44:39,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2022-11-21 13:44:39,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2022-11-21 13:44:39,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2022-11-21 13:44:39,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2022-11-21 13:44:39,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2022-11-21 13:44:39,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2022-11-21 13:44:39,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2022-11-21 13:44:39,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2022-11-21 13:44:39,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2022-11-21 13:44:39,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2022-11-21 13:44:39,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2022-11-21 13:44:39,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2022-11-21 13:44:39,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2022-11-21 13:44:39,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2022-11-21 13:44:39,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2022-11-21 13:44:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2022-11-21 13:44:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2022-11-21 13:44:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2022-11-21 13:44:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2022-11-21 13:44:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2022-11-21 13:44:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2022-11-21 13:44:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2022-11-21 13:44:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2022-11-21 13:44:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2022-11-21 13:44:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2022-11-21 13:44:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2022-11-21 13:44:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2022-11-21 13:44:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2022-11-21 13:44:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2022-11-21 13:44:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2022-11-21 13:44:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2022-11-21 13:44:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2022-11-21 13:44:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2022-11-21 13:44:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2022-11-21 13:44:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2022-11-21 13:44:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2022-11-21 13:44:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2022-11-21 13:44:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2022-11-21 13:44:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2022-11-21 13:44:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2022-11-21 13:44:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2022-11-21 13:44:39,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2022-11-21 13:44:39,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2022-11-21 13:44:39,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 13:44:39,970 INFO L444 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:39,976 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 13:44:39,976 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 13:44:40,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:44:40 BasicIcfg [2022-11-21 13:44:40,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 13:44:40,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 13:44:40,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 13:44:40,078 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 13:44:40,078 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:43:31" (3/4) ... [2022-11-21 13:44:40,081 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 13:44:40,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 13:44:40,082 INFO L158 Benchmark]: Toolchain (without parser) took 70818.83ms. Allocated memory was 165.7MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 137.9MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2022-11-21 13:44:40,082 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 165.7MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:44:40,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 638.32ms. Allocated memory is still 165.7MB. Free memory was 137.9MB in the beginning and 111.7MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-21 13:44:40,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.35ms. Allocated memory is still 165.7MB. Free memory was 111.7MB in the beginning and 108.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:44:40,083 INFO L158 Benchmark]: Boogie Preprocessor took 34.01ms. Allocated memory is still 165.7MB. Free memory was 108.9MB in the beginning and 106.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:44:40,083 INFO L158 Benchmark]: RCFGBuilder took 1793.64ms. Allocated memory was 165.7MB in the beginning and 216.0MB in the end (delta: 50.3MB). Free memory was 106.2MB in the beginning and 153.5MB in the end (delta: -47.3MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2022-11-21 13:44:40,084 INFO L158 Benchmark]: TraceAbstraction took 68274.69ms. Allocated memory was 216.0MB in the beginning and 5.8GB in the end (delta: 5.5GB). Free memory was 152.5MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2022-11-21 13:44:40,084 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 5.8GB. Free memory was 3.7GB in the beginning and 3.7GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:44:40,086 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.17ms. Allocated memory is still 165.7MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 638.32ms. Allocated memory is still 165.7MB. Free memory was 137.9MB in the beginning and 111.7MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.35ms. Allocated memory is still 165.7MB. Free memory was 111.7MB in the beginning and 108.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.01ms. Allocated memory is still 165.7MB. Free memory was 108.9MB in the beginning and 106.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1793.64ms. Allocated memory was 165.7MB in the beginning and 216.0MB in the end (delta: 50.3MB). Free memory was 106.2MB in the beginning and 153.5MB in the end (delta: -47.3MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. * TraceAbstraction took 68274.69ms. Allocated memory was 216.0MB in the beginning and 5.8GB in the end (delta: 5.5GB). Free memory was 152.5MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 5.8GB. Free memory was 3.7GB in the beginning and 3.7GB 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: 30.7s, 204 PlacesBefore, 100 PlacesAfterwards, 196 TransitionsBefore, 91 TransitionsAfterwards, 9024 CoEnabledTransitionPairs, 8 FixpointIterations, 73 TrivialSequentialCompositions, 120 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 200 TotalNumberOfCompositions, 45004 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17405, independent: 16790, independent conditional: 0, independent unconditional: 16790, dependent: 602, dependent conditional: 0, dependent unconditional: 602, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6437, independent: 6331, independent conditional: 0, independent unconditional: 6331, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6437, independent: 4928, independent conditional: 0, independent unconditional: 4928, dependent: 1509, dependent conditional: 0, dependent unconditional: 1509, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1509, independent: 1403, independent conditional: 0, independent unconditional: 1403, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7622, independent: 5341, independent conditional: 0, independent unconditional: 5341, dependent: 2187, dependent conditional: 0, dependent unconditional: 2187, unknown: 94, unknown conditional: 0, unknown unconditional: 94] ], Cache Queries: [ total: 17405, independent: 10459, independent conditional: 0, independent unconditional: 10459, dependent: 501, dependent conditional: 0, dependent unconditional: 501, unknown: 6445, unknown conditional: 0, unknown unconditional: 6445] , Statistics on independence cache: Total cache size (in pairs): 961, Positive cache size: 907, Positive conditional cache size: 0, Positive unconditional cache size: 907, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2381; [L855] FCALL, FORK 0 pthread_create(&t2381, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2381, ((void *)0), P0, ((void *)0))=-2, t2381={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L856] 0 pthread_t t2382; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2381={7:0}, t2382={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L857] FCALL, FORK 0 pthread_create(&t2382, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2382, ((void *)0), P1, ((void *)0))=-1, t2381={7:0}, t2382={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L858] 0 pthread_t t2383; [L859] FCALL, FORK 0 pthread_create(&t2383, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2383, ((void *)0), P2, ((void *)0))=0, t2381={7:0}, t2382={5:0}, t2383={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L829] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L761] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !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) [L770] EXPR 1 \read(x) [L770] EXPR 1 !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) [L770] 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) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 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)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L794] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 \read(x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] 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) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L865] EXPR 0 \read(x) [L865] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 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) [L866] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L867] 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 [L868] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L869] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2381={7:0}, t2382={5:0}, t2383={6:0}, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 x$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(x) [L875] 0 x$mem_tmp = x [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 \read(x) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L877] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L878] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L879] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L880] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L882] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L884] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L884] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L885] EXPR 0 \read(x) [L885] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L886] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L886] 0 x = x$flush_delayed ? x$mem_tmp : x [L887] 0 x$flush_delayed = (_Bool)0 [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 855]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 257 locations, 101 error locations. Started 1 CEGAR loops. OverallTime: 67.9s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.2s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 34.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1330 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1330 mSDsluCounter, 257 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 495 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2911 IncrementalHoareTripleChecker+Invalid, 3406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 495 mSolverCounterUnsat, 109 mSDtfsCounter, 2911 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119052occurred in iteration=0, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 6501 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 4128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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-21 13:44:40,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe025_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a --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 245f8deca690daafc67ff44dd7680fe4934c4e890117db34905ca3a31fc7577b --- 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-b5237d8 [2022-11-21 13:44:42,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:44:42,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:44:42,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:44:42,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:44:42,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:44:42,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:44:42,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:44:42,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:44:42,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:44:42,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:44:42,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:44:42,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:44:42,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:44:42,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:44:42,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:44:42,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:44:42,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:44:42,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:44:42,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:44:42,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:44:42,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:44:42,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:44:42,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:44:42,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:44:42,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:44:42,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:44:42,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:44:42,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:44:42,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:44:42,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:44:42,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:44:42,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:44:42,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:44:42,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:44:42,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:44:42,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:44:42,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:44:42,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:44:42,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:44:42,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:44:42,865 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 13:44:42,904 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:44:42,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:44:42,906 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:44:42,906 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:44:42,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:44:42,907 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:44:42,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:44:42,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:44:42,908 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:44:42,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:44:42,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:44:42,910 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:44:42,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:44:42,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:44:42,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:44:42,911 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:44:42,911 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:44:42,911 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:44:42,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:44:42,912 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:44:42,912 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 13:44:42,912 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 13:44:42,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:44:42,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:44:42,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:44:42,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:44:42,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:44:42,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:44:42,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:44:42,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:44:42,914 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 13:44:42,914 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 13:44:42,915 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 13:44:42,915 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_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a 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 -> 245f8deca690daafc67ff44dd7680fe4934c4e890117db34905ca3a31fc7577b [2022-11-21 13:44:43,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:44:43,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:44:43,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:44:43,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:44:43,348 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:44:43,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe025_rmo.i [2022-11-21 13:44:46,317 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:44:46,686 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:44:46,686 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/sv-benchmarks/c/pthread-wmm/safe025_rmo.i [2022-11-21 13:44:46,699 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/data/e6d9ac2c9/0159a02ebdf44ba891b98cef689db178/FLAG6a259db1c [2022-11-21 13:44:46,716 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/data/e6d9ac2c9/0159a02ebdf44ba891b98cef689db178 [2022-11-21 13:44:46,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:44:46,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:44:46,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:44:46,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:44:46,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:44:46,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:44:46" (1/1) ... [2022-11-21 13:44:46,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c51c23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:46, skipping insertion in model container [2022-11-21 13:44:46,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:44:46" (1/1) ... [2022-11-21 13:44:46,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:44:46,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:44:46,950 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/sv-benchmarks/c/pthread-wmm/safe025_rmo.i[988,1001] [2022-11-21 13:44:47,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:44:47,280 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:44:47,295 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/sv-benchmarks/c/pthread-wmm/safe025_rmo.i[988,1001] [2022-11-21 13:44:47,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:44:47,430 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:44:47,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47 WrapperNode [2022-11-21 13:44:47,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:44:47,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:44:47,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:44:47,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:44:47,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47" (1/1) ... [2022-11-21 13:44:47,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47" (1/1) ... [2022-11-21 13:44:47,511 INFO L138 Inliner]: procedures = 180, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2022-11-21 13:44:47,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:44:47,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:44:47,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:44:47,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:44:47,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47" (1/1) ... [2022-11-21 13:44:47,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47" (1/1) ... [2022-11-21 13:44:47,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47" (1/1) ... [2022-11-21 13:44:47,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47" (1/1) ... [2022-11-21 13:44:47,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47" (1/1) ... [2022-11-21 13:44:47,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47" (1/1) ... [2022-11-21 13:44:47,543 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47" (1/1) ... [2022-11-21 13:44:47,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47" (1/1) ... [2022-11-21 13:44:47,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:44:47,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:44:47,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:44:47,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:44:47,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47" (1/1) ... [2022-11-21 13:44:47,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:44:47,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:44:47,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:44:47,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:44:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-21 13:44:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 13:44:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:44:47,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:44:47,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:44:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 13:44:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 13:44:47,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-21 13:44:47,652 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 13:44:47,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 13:44:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 13:44:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 13:44:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 13:44:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 13:44:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 13:44:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:44:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:44:47,655 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 13:44:47,874 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:44:47,876 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:44:48,657 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:44:49,444 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:44:49,445 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 13:44:49,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:44:49 BoogieIcfgContainer [2022-11-21 13:44:49,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:44:49,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:44:49,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:44:49,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:44:49,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:44:46" (1/3) ... [2022-11-21 13:44:49,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f447ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:44:49, skipping insertion in model container [2022-11-21 13:44:49,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:44:47" (2/3) ... [2022-11-21 13:44:49,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f447ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:44:49, skipping insertion in model container [2022-11-21 13:44:49,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:44:49" (3/3) ... [2022-11-21 13:44:49,474 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_rmo.i [2022-11-21 13:44:49,494 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:44:49,494 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-11-21 13:44:49,495 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 13:44:49,705 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 13:44:49,749 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 13:44:49,779 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 197 transitions, 409 flow [2022-11-21 13:44:49,784 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 197 transitions, 409 flow [2022-11-21 13:44:49,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 197 transitions, 409 flow [2022-11-21 13:44:49,939 INFO L130 PetriNetUnfolder]: 2/194 cut-off events. [2022-11-21 13:44:49,939 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 13:44:49,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 2/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 350 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-11-21 13:44:49,953 INFO L119 LiptonReduction]: Number of co-enabled transitions 9024 [2022-11-21 13:45:39,674 INFO L134 LiptonReduction]: Checked pairs total: 45142 [2022-11-21 13:45:39,674 INFO L136 LiptonReduction]: Total number of compositions: 201 [2022-11-21 13:45:39,681 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 100 places, 91 transitions, 197 flow [2022-11-21 13:45:43,252 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 119052 states, 77022 states have (on average 5.878671029056633) internal successors, (452787), 119051 states have internal predecessors, (452787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:43,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:45:43,297 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;@532a348d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:45:43,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2022-11-21 13:45:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 119052 states, 77022 states have (on average 5.878671029056633) internal successors, (452787), 119051 states have internal predecessors, (452787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 13:45:43,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:43,669 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 13:45:43,671 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:45:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:43,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1235, now seen corresponding path program 1 times [2022-11-21 13:45:43,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:45:43,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250796525] [2022-11-21 13:45:43,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:43,697 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-21 13:45:43,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:45:43,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:43,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:44,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 13:45:44,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:44,085 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-21 13:45:44,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:45:44,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:45:44,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250796525] [2022-11-21 13:45:44,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250796525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:44,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:44,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 13:45:44,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237744243] [2022-11-21 13:45:44,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:44,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:45:44,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:45:44,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:45:44,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:45:44,294 INFO L87 Difference]: Start difference. First operand has 119052 states, 77022 states have (on average 5.878671029056633) internal successors, (452787), 119051 states have internal predecessors, (452787), 0 states have call successors, (0), 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-21 13:45:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:45,085 INFO L93 Difference]: Finished difference Result 14832 states and 53255 transitions. [2022-11-21 13:45:45,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:45:45,087 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-21 13:45:45,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:45,353 INFO L225 Difference]: With dead ends: 14832 [2022-11-21 13:45:45,353 INFO L226 Difference]: Without dead ends: 14832 [2022-11-21 13:45:45,354 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-21 13:45:45,360 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:45,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14832 states. [2022-11-21 13:45:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14832 to 14832. [2022-11-21 13:45:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14832 states, 12754 states have (on average 4.175552767759134) internal successors, (53255), 14831 states have internal predecessors, (53255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14832 states to 14832 states and 53255 transitions. [2022-11-21 13:45:46,246 INFO L78 Accepts]: Start accepts. Automaton has 14832 states and 53255 transitions. Word has length 1 [2022-11-21 13:45:46,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:46,247 INFO L495 AbstractCegarLoop]: Abstraction has 14832 states and 53255 transitions. [2022-11-21 13:45:46,248 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-21 13:45:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 14832 states and 53255 transitions. [2022-11-21 13:45:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 13:45:46,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:46,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 13:45:46,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:46,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:46,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:45:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:46,466 INFO L85 PathProgramCache]: Analyzing trace with hash 37824047, now seen corresponding path program 1 times [2022-11-21 13:45:46,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:45:46,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437336436] [2022-11-21 13:45:46,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:46,467 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-21 13:45:46,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:45:46,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:46,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:46,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:45:46,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:46,904 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 13:45:46,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:45:46,940 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-21 13:45:46,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:45:46,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:45:46,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437336436] [2022-11-21 13:45:46,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437336436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:46,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:46,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:45:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133223407] [2022-11-21 13:45:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:46,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:45:46,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:45:46,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:45:46,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:46,944 INFO L87 Difference]: Start difference. First operand 14832 states and 53255 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:47,306 INFO L93 Difference]: Finished difference Result 7176 states and 24912 transitions. [2022-11-21 13:45:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:45:47,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-21 13:45:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:47,487 INFO L225 Difference]: With dead ends: 7176 [2022-11-21 13:45:47,487 INFO L226 Difference]: Without dead ends: 7176 [2022-11-21 13:45:47,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:47,490 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:47,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 4 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:45:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7176 states. [2022-11-21 13:45:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7176 to 7176. [2022-11-21 13:45:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7176 states, 6559 states have (on average 3.798139960359811) internal successors, (24912), 7175 states have internal predecessors, (24912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7176 states to 7176 states and 24912 transitions. [2022-11-21 13:45:47,785 INFO L78 Accepts]: Start accepts. Automaton has 7176 states and 24912 transitions. Word has length 4 [2022-11-21 13:45:47,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:47,788 INFO L495 AbstractCegarLoop]: Abstraction has 7176 states and 24912 transitions. [2022-11-21 13:45:47,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 7176 states and 24912 transitions. [2022-11-21 13:45:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 13:45:47,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:47,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 13:45:47,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:48,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:48,001 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:45:48,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash 37824048, now seen corresponding path program 1 times [2022-11-21 13:45:48,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:45:48,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689708620] [2022-11-21 13:45:48,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:48,003 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-21 13:45:48,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:45:48,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:48,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:48,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:45:48,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:48,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:48,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:45:48,474 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-21 13:45:48,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:45:48,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:45:48,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689708620] [2022-11-21 13:45:48,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689708620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:48,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:48,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:45:48,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610474254] [2022-11-21 13:45:48,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:48,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:45:48,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:45:48,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:45:48,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:48,478 INFO L87 Difference]: Start difference. First operand 7176 states and 24912 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:48,645 INFO L93 Difference]: Finished difference Result 2206 states and 7261 transitions. [2022-11-21 13:45:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:45:48,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-21 13:45:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:48,655 INFO L225 Difference]: With dead ends: 2206 [2022-11-21 13:45:48,655 INFO L226 Difference]: Without dead ends: 2206 [2022-11-21 13:45:48,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:48,657 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:48,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2022-11-21 13:45:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 2206. [2022-11-21 13:45:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 2124 states have (on average 3.4185499058380415) internal successors, (7261), 2205 states have internal predecessors, (7261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 7261 transitions. [2022-11-21 13:45:48,717 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 7261 transitions. Word has length 4 [2022-11-21 13:45:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:48,717 INFO L495 AbstractCegarLoop]: Abstraction has 2206 states and 7261 transitions. [2022-11-21 13:45:48,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 7261 transitions. [2022-11-21 13:45:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 13:45:48,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:48,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:48,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:48,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:48,931 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:45:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1050396383, now seen corresponding path program 1 times [2022-11-21 13:45:48,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:45:48,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936894215] [2022-11-21 13:45:48,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:48,933 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-21 13:45:48,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:45:48,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:48,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:49,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:45:49,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:49,297 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-21 13:45:49,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:45:49,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:45:49,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936894215] [2022-11-21 13:45:49,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936894215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:49,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:49,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:45:49,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676822766] [2022-11-21 13:45:49,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:49,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:45:49,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:45:49,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:45:49,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:49,301 INFO L87 Difference]: Start difference. First operand 2206 states and 7261 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-21 13:45:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:49,501 INFO L93 Difference]: Finished difference Result 1023 states and 2708 transitions. [2022-11-21 13:45:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:45:49,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-21 13:45:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:49,505 INFO L225 Difference]: With dead ends: 1023 [2022-11-21 13:45:49,505 INFO L226 Difference]: Without dead ends: 1023 [2022-11-21 13:45:49,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-21 13:45:49,506 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10 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-21 13:45:49,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2022-11-21 13:45:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2022-11-21 13:45:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 965 states have (on average 2.806217616580311) internal successors, (2708), 1022 states have internal predecessors, (2708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 2708 transitions. [2022-11-21 13:45:49,530 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 2708 transitions. Word has length 11 [2022-11-21 13:45:49,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:49,530 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 2708 transitions. [2022-11-21 13:45:49,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-21 13:45:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 2708 transitions. [2022-11-21 13:45:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:45:49,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:49,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:49,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:49,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:49,744 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:45:49,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:49,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1529388905, now seen corresponding path program 1 times [2022-11-21 13:45:49,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:45:49,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851757343] [2022-11-21 13:45:49,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:49,745 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-21 13:45:49,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:45:49,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:49,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:50,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:45:50,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:50,103 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-21 13:45:50,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:45:50,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:45:50,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851757343] [2022-11-21 13:45:50,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851757343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:50,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:50,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721140404] [2022-11-21 13:45:50,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:50,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:45:50,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:45:50,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:45:50,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:45:50,108 INFO L87 Difference]: Start difference. First operand 1023 states and 2708 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:50,381 INFO L93 Difference]: Finished difference Result 322 states and 687 transitions. [2022-11-21 13:45:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:45:50,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 13:45:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:50,383 INFO L225 Difference]: With dead ends: 322 [2022-11-21 13:45:50,383 INFO L226 Difference]: Without dead ends: 322 [2022-11-21 13:45:50,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:45:50,384 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:50,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 18 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:45:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-21 13:45:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2022-11-21 13:45:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 302 states have (on average 2.274834437086093) internal successors, (687), 321 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 687 transitions. [2022-11-21 13:45:50,421 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 687 transitions. Word has length 14 [2022-11-21 13:45:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:50,421 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 687 transitions. [2022-11-21 13:45:50,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 687 transitions. [2022-11-21 13:45:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 13:45:50,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:50,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:50,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:50,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:50,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:45:50,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:50,624 INFO L85 PathProgramCache]: Analyzing trace with hash -105442571, now seen corresponding path program 1 times [2022-11-21 13:45:50,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:45:50,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422598627] [2022-11-21 13:45:50,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:50,625 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-21 13:45:50,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:45:50,632 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:50,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:50,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:45:50,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:51,035 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-21 13:45:51,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:45:51,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:45:51,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422598627] [2022-11-21 13:45:51,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422598627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:51,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:51,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:51,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789058670] [2022-11-21 13:45:51,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:51,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:51,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:45:51,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:51,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:51,038 INFO L87 Difference]: Start difference. First operand 322 states and 687 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:51,373 INFO L93 Difference]: Finished difference Result 183 states and 420 transitions. [2022-11-21 13:45:51,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:51,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-21 13:45:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:51,374 INFO L225 Difference]: With dead ends: 183 [2022-11-21 13:45:51,374 INFO L226 Difference]: Without dead ends: 183 [2022-11-21 13:45:51,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-21 13:45:51,375 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:51,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 31 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:45:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-21 13:45:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-21 13:45:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 2.346368715083799) internal successors, (420), 182 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 420 transitions. [2022-11-21 13:45:51,380 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 420 transitions. Word has length 18 [2022-11-21 13:45:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:51,381 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 420 transitions. [2022-11-21 13:45:51,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 420 transitions. [2022-11-21 13:45:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:45:51,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:51,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:51,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-21 13:45:51,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:51,595 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:45:51,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:51,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1365546664, now seen corresponding path program 1 times [2022-11-21 13:45:51,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:45:51,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713043908] [2022-11-21 13:45:51,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:51,597 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-21 13:45:51,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:45:51,599 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:51,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:51,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:45:51,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:45:52,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:45:52,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:45:52,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713043908] [2022-11-21 13:45:52,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713043908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:52,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:52,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:52,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731549902] [2022-11-21 13:45:52,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:52,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:45:52,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:52,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:52,376 INFO L87 Difference]: Start difference. First operand 183 states and 420 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:52,587 INFO L93 Difference]: Finished difference Result 182 states and 419 transitions. [2022-11-21 13:45:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:52,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:45:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:52,588 INFO L225 Difference]: With dead ends: 182 [2022-11-21 13:45:52,588 INFO L226 Difference]: Without dead ends: 182 [2022-11-21 13:45:52,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:45:52,589 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:52,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-21 13:45:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-11-21 13:45:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 179 states have (on average 2.340782122905028) internal successors, (419), 181 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 419 transitions. [2022-11-21 13:45:52,594 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 419 transitions. Word has length 22 [2022-11-21 13:45:52,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:52,594 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 419 transitions. [2022-11-21 13:45:52,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 419 transitions. [2022-11-21 13:45:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:45:52,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:52,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:52,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-21 13:45:52,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:52,809 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:45:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1365546663, now seen corresponding path program 1 times [2022-11-21 13:45:52,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:45:52,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563419327] [2022-11-21 13:45:52,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:52,809 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-21 13:45:52,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:45:52,810 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:52,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-21 13:45:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:53,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 13:45:53,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:53,648 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-21 13:45:53,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:45:53,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:45:53,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563419327] [2022-11-21 13:45:53,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563419327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:53,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:53,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:53,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509365757] [2022-11-21 13:45:53,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:53,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:53,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:45:53,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:53,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:53,650 INFO L87 Difference]: Start difference. First operand 182 states and 419 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:53,885 INFO L93 Difference]: Finished difference Result 181 states and 418 transitions. [2022-11-21 13:45:53,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:53,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:45:53,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:53,887 INFO L225 Difference]: With dead ends: 181 [2022-11-21 13:45:53,887 INFO L226 Difference]: Without dead ends: 181 [2022-11-21 13:45:53,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:45:53,888 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:53,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-21 13:45:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-11-21 13:45:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.335195530726257) internal successors, (418), 180 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 418 transitions. [2022-11-21 13:45:53,895 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 418 transitions. Word has length 22 [2022-11-21 13:45:53,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:53,895 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 418 transitions. [2022-11-21 13:45:53,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 418 transitions. [2022-11-21 13:45:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:45:53,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:53,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:53,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-21 13:45:54,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:54,106 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:45:54,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1365546319, now seen corresponding path program 1 times [2022-11-21 13:45:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:45:54,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931253202] [2022-11-21 13:45:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:54,108 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-21 13:45:54,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:45:54,109 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:54,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-21 13:45:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:54,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 13:45:54,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:54,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:45:54,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-21 13:45:54,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 13:45:54,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 13:45:54,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:45:55,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:45:55,222 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-21 13:45:55,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:45:55,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:45:55,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931253202] [2022-11-21 13:45:55,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931253202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:55,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:55,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:55,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731144593] [2022-11-21 13:45:55,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:55,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:45:55,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:45:55,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:45:55,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:45:55,226 INFO L87 Difference]: Start difference. First operand 181 states and 418 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:55,860 INFO L93 Difference]: Finished difference Result 349 states and 765 transitions. [2022-11-21 13:45:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:45:55,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:45:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:55,862 INFO L225 Difference]: With dead ends: 349 [2022-11-21 13:45:55,863 INFO L226 Difference]: Without dead ends: 349 [2022-11-21 13:45:55,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:45:55,864 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:55,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 13:45:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-21 13:45:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 267. [2022-11-21 13:45:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 265 states have (on average 2.29811320754717) internal successors, (609), 266 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 609 transitions. [2022-11-21 13:45:55,875 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 609 transitions. Word has length 22 [2022-11-21 13:45:55,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:55,876 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 609 transitions. [2022-11-21 13:45:55,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 609 transitions. [2022-11-21 13:45:55,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:45:55,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:55,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:55,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-21 13:45:56,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:56,091 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:45:56,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:56,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1144836657, now seen corresponding path program 2 times [2022-11-21 13:45:56,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:45:56,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037961797] [2022-11-21 13:45:56,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:45:56,093 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-21 13:45:56,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:45:56,094 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:56,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-21 13:45:56,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 13:45:56,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:45:56,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 13:45:56,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:56,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:45:56,708 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-21 13:45:56,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:45:56,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:45:56,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037961797] [2022-11-21 13:45:56,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037961797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:56,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:56,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:56,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284610541] [2022-11-21 13:45:56,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:56,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:45:56,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:45:56,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:45:56,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:45:56,710 INFO L87 Difference]: Start difference. First operand 267 states and 609 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:57,029 INFO L93 Difference]: Finished difference Result 369 states and 820 transitions. [2022-11-21 13:45:57,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:45:57,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:45:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:57,031 INFO L225 Difference]: With dead ends: 369 [2022-11-21 13:45:57,031 INFO L226 Difference]: Without dead ends: 369 [2022-11-21 13:45:57,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:45:57,031 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:57,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 14 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:45:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-21 13:45:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 249. [2022-11-21 13:45:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 247 states have (on average 2.3076923076923075) internal successors, (570), 248 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 570 transitions. [2022-11-21 13:45:57,038 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 570 transitions. Word has length 22 [2022-11-21 13:45:57,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:57,039 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 570 transitions. [2022-11-21 13:45:57,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 570 transitions. [2022-11-21 13:45:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:45:57,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:57,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:57,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-21 13:45:57,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:57,254 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:45:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1801253347, now seen corresponding path program 3 times [2022-11-21 13:45:57,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:45:57,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416895926] [2022-11-21 13:45:57,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:45:57,255 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-21 13:45:57,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:45:57,256 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:57,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-21 13:45:57,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-21 13:45:57,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:45:57,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-21 13:45:57,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:57,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-11-21 13:45:57,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-21 13:45:58,015 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-21 13:45:58,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:45:58,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:45:58,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416895926] [2022-11-21 13:45:58,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416895926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:58,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:58,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:45:58,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568336605] [2022-11-21 13:45:58,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:58,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:45:58,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:45:58,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:45:58,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:45:58,017 INFO L87 Difference]: Start difference. First operand 249 states and 570 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:58,325 INFO L93 Difference]: Finished difference Result 364 states and 808 transitions. [2022-11-21 13:45:58,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:45:58,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:45:58,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:58,326 INFO L225 Difference]: With dead ends: 364 [2022-11-21 13:45:58,326 INFO L226 Difference]: Without dead ends: 364 [2022-11-21 13:45:58,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:58,327 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:58,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:45:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-21 13:45:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 239. [2022-11-21 13:45:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 237 states have (on average 2.3164556962025316) internal successors, (549), 238 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 549 transitions. [2022-11-21 13:45:58,338 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 549 transitions. Word has length 22 [2022-11-21 13:45:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:58,339 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 549 transitions. [2022-11-21 13:45:58,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 549 transitions. [2022-11-21 13:45:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:45:58,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:58,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:58,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-21 13:45:58,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:58,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:45:58,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:58,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1747014627, now seen corresponding path program 4 times [2022-11-21 13:45:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:45:58,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962026799] [2022-11-21 13:45:58,546 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:45:58,547 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-21 13:45:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:45:58,547 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:45:58,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (13)] Waiting until timeout for monitored process [2022-11-21 13:45:58,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:45:58,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:45:58,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-21 13:45:58,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:59,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-11-21 13:45:59,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 13:45:59,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 13:45:59,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-11-21 13:45:59,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-21 13:46:00,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-21 13:46:00,291 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-21 13:46:00,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:46:00,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:46:00,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962026799] [2022-11-21 13:46:00,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962026799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:00,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:00,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:46:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290438621] [2022-11-21 13:46:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:00,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:46:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:46:00,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:46:00,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:46:00,293 INFO L87 Difference]: Start difference. First operand 239 states and 549 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:00,718 INFO L93 Difference]: Finished difference Result 308 states and 684 transitions. [2022-11-21 13:46:00,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:46:00,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:46:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:00,720 INFO L225 Difference]: With dead ends: 308 [2022-11-21 13:46:00,720 INFO L226 Difference]: Without dead ends: 308 [2022-11-21 13:46:00,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:46:00,721 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:00,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 6 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:46:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-21 13:46:00,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 229. [2022-11-21 13:46:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 227 states have (on average 2.3083700440528636) internal successors, (524), 228 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 524 transitions. [2022-11-21 13:46:00,734 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 524 transitions. Word has length 22 [2022-11-21 13:46:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:00,734 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 524 transitions. [2022-11-21 13:46:00,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 524 transitions. [2022-11-21 13:46:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:46:00,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:00,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:00,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (13)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:00,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:00,950 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:46:00,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1771788893, now seen corresponding path program 5 times [2022-11-21 13:46:00,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:46:00,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178322745] [2022-11-21 13:46:00,951 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:46:00,951 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-21 13:46:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:46:00,952 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:00,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (14)] Waiting until timeout for monitored process [2022-11-21 13:46:01,330 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 13:46:01,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:46:01,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-21 13:46:01,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:01,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-11-21 13:46:01,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-21 13:46:01,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-21 13:46:01,917 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-21 13:46:01,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:46:01,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:46:01,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178322745] [2022-11-21 13:46:01,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178322745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:01,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:01,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:46:01,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100487303] [2022-11-21 13:46:01,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:01,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:46:01,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:46:01,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:46:01,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:46:01,919 INFO L87 Difference]: Start difference. First operand 229 states and 524 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:02,313 INFO L93 Difference]: Finished difference Result 344 states and 762 transitions. [2022-11-21 13:46:02,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:46:02,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:46:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:02,315 INFO L225 Difference]: With dead ends: 344 [2022-11-21 13:46:02,315 INFO L226 Difference]: Without dead ends: 344 [2022-11-21 13:46:02,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:46:02,318 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:02,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:46:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-11-21 13:46:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 224. [2022-11-21 13:46:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 222 states have (on average 2.3018018018018016) internal successors, (511), 223 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 511 transitions. [2022-11-21 13:46:02,324 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 511 transitions. Word has length 22 [2022-11-21 13:46:02,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:02,324 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 511 transitions. [2022-11-21 13:46:02,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 511 transitions. [2022-11-21 13:46:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:46:02,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:02,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:02,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (14)] Ended with exit code 0 [2022-11-21 13:46:02,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:02,544 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:46:02,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:02,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1939376035, now seen corresponding path program 6 times [2022-11-21 13:46:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:46:02,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066834160] [2022-11-21 13:46:02,546 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 13:46:02,546 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-21 13:46:02,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:46:02,548 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:02,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (15)] Waiting until timeout for monitored process [2022-11-21 13:46:02,936 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-21 13:46:02,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:46:02,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 13:46:02,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:03,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-11-21 13:46:03,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-21 13:46:04,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-21 13:46:04,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-21 13:46:04,391 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-21 13:46:04,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:46:04,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:46:04,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066834160] [2022-11-21 13:46:04,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066834160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:04,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:04,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:46:04,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096701847] [2022-11-21 13:46:04,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:04,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:46:04,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:46:04,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:46:04,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:46:04,393 INFO L87 Difference]: Start difference. First operand 224 states and 511 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:04,768 INFO L93 Difference]: Finished difference Result 293 states and 646 transitions. [2022-11-21 13:46:04,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:46:04,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:46:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:04,770 INFO L225 Difference]: With dead ends: 293 [2022-11-21 13:46:04,770 INFO L226 Difference]: Without dead ends: 293 [2022-11-21 13:46:04,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:46:04,771 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:04,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:46:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-21 13:46:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 219. [2022-11-21 13:46:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 217 states have (on average 2.2857142857142856) internal successors, (496), 218 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 496 transitions. [2022-11-21 13:46:04,777 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 496 transitions. Word has length 22 [2022-11-21 13:46:04,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:04,777 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 496 transitions. [2022-11-21 13:46:04,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 496 transitions. [2022-11-21 13:46:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:46:04,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:04,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:04,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (15)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:04,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:04,979 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:46:04,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:04,979 INFO L85 PathProgramCache]: Analyzing trace with hash -653399359, now seen corresponding path program 7 times [2022-11-21 13:46:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:46:04,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427390422] [2022-11-21 13:46:04,980 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 13:46:04,980 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-21 13:46:04,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:46:04,981 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:04,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (16)] Waiting until timeout for monitored process [2022-11-21 13:46:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:05,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 13:46:05,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:05,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:46:05,578 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:46:05,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-21 13:46:05,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:46:05,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2022-11-21 13:46:06,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-21 13:46:06,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:46:06,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:46:06,966 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-21 13:46:06,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:46:06,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:46:06,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427390422] [2022-11-21 13:46:06,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427390422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:06,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:06,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:46:06,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858675833] [2022-11-21 13:46:06,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:06,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:46:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:46:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:46:06,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:46:06,967 INFO L87 Difference]: Start difference. First operand 219 states and 496 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:08,090 INFO L93 Difference]: Finished difference Result 377 states and 856 transitions. [2022-11-21 13:46:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:46:08,091 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:46:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:08,093 INFO L225 Difference]: With dead ends: 377 [2022-11-21 13:46:08,093 INFO L226 Difference]: Without dead ends: 377 [2022-11-21 13:46:08,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:46:08,094 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:08,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 22 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 13:46:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-21 13:46:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 226. [2022-11-21 13:46:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 224 states have (on average 2.3035714285714284) internal successors, (516), 225 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 516 transitions. [2022-11-21 13:46:08,101 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 516 transitions. Word has length 22 [2022-11-21 13:46:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:08,101 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 516 transitions. [2022-11-21 13:46:08,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 516 transitions. [2022-11-21 13:46:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:46:08,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:08,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:08,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (16)] Ended with exit code 0 [2022-11-21 13:46:08,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:08,316 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:46:08,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:08,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1059196163, now seen corresponding path program 8 times [2022-11-21 13:46:08,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:46:08,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032282223] [2022-11-21 13:46:08,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:46:08,317 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-21 13:46:08,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:46:08,318 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:08,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (17)] Waiting until timeout for monitored process [2022-11-21 13:46:08,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 13:46:08,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:46:08,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-21 13:46:08,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:08,800 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 13:46:08,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-21 13:46:08,900 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 13:46:08,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-21 13:46:08,993 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:46:08,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-21 13:46:09,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:46:09,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:46:09,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2022-11-21 13:46:09,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-21 13:46:10,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:46:10,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:46:10,461 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-21 13:46:10,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:46:10,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:46:10,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032282223] [2022-11-21 13:46:10,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032282223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:10,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:10,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:46:10,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26092437] [2022-11-21 13:46:10,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:10,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:46:10,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:46:10,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:46:10,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:46:10,464 INFO L87 Difference]: Start difference. First operand 226 states and 516 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:11,509 INFO L93 Difference]: Finished difference Result 306 states and 681 transitions. [2022-11-21 13:46:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:46:11,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:46:11,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:11,511 INFO L225 Difference]: With dead ends: 306 [2022-11-21 13:46:11,511 INFO L226 Difference]: Without dead ends: 306 [2022-11-21 13:46:11,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-21 13:46:11,512 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 46 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:11,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 13 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:46:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-21 13:46:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 223. [2022-11-21 13:46:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 221 states have (on average 2.2941176470588234) internal successors, (507), 222 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 507 transitions. [2022-11-21 13:46:11,519 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 507 transitions. Word has length 22 [2022-11-21 13:46:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:11,520 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 507 transitions. [2022-11-21 13:46:11,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 507 transitions. [2022-11-21 13:46:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:46:11,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:11,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:11,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (17)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:11,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:11,729 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:46:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1612665917, now seen corresponding path program 9 times [2022-11-21 13:46:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:46:11,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882406843] [2022-11-21 13:46:11,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:46:11,732 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-21 13:46:11,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:46:11,733 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:11,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (18)] Waiting until timeout for monitored process [2022-11-21 13:46:12,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-21 13:46:12,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:46:12,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-21 13:46:12,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:12,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:46:12,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-21 13:46:13,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:46:13,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:46:13,553 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-21 13:46:13,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:46:13,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:46:13,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882406843] [2022-11-21 13:46:13,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882406843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:13,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:13,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:46:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879006857] [2022-11-21 13:46:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:13,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:46:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:46:13,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:46:13,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:46:13,556 INFO L87 Difference]: Start difference. First operand 223 states and 507 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:14,146 INFO L93 Difference]: Finished difference Result 296 states and 653 transitions. [2022-11-21 13:46:14,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:46:14,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:46:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:14,147 INFO L225 Difference]: With dead ends: 296 [2022-11-21 13:46:14,147 INFO L226 Difference]: Without dead ends: 296 [2022-11-21 13:46:14,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:46:14,148 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:14,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 10 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 13:46:14,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-21 13:46:14,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 216. [2022-11-21 13:46:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 214 states have (on average 2.2803738317757007) internal successors, (488), 215 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 488 transitions. [2022-11-21 13:46:14,155 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 488 transitions. Word has length 22 [2022-11-21 13:46:14,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:14,155 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 488 transitions. [2022-11-21 13:46:14,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 488 transitions. [2022-11-21 13:46:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:46:14,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:14,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:14,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (18)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:14,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:14,369 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-21 13:46:14,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:14,370 INFO L85 PathProgramCache]: Analyzing trace with hash -68624593, now seen corresponding path program 10 times [2022-11-21 13:46:14,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:46:14,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074143032] [2022-11-21 13:46:14,370 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:46:14,370 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-21 13:46:14,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:46:14,372 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:14,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (19)] Waiting until timeout for monitored process [2022-11-21 13:46:14,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:46:14,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 13:46:14,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:46:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:46:15,057 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-21 13:46:15,058 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 13:46:15,059 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2022-11-21 13:46:15,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2022-11-21 13:46:15,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2022-11-21 13:46:15,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2022-11-21 13:46:15,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2022-11-21 13:46:15,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2022-11-21 13:46:15,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2022-11-21 13:46:15,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2022-11-21 13:46:15,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2022-11-21 13:46:15,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2022-11-21 13:46:15,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2022-11-21 13:46:15,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2022-11-21 13:46:15,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2022-11-21 13:46:15,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2022-11-21 13:46:15,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2022-11-21 13:46:15,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2022-11-21 13:46:15,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2022-11-21 13:46:15,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2022-11-21 13:46:15,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2022-11-21 13:46:15,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2022-11-21 13:46:15,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2022-11-21 13:46:15,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2022-11-21 13:46:15,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2022-11-21 13:46:15,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2022-11-21 13:46:15,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2022-11-21 13:46:15,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2022-11-21 13:46:15,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2022-11-21 13:46:15,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2022-11-21 13:46:15,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2022-11-21 13:46:15,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2022-11-21 13:46:15,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2022-11-21 13:46:15,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2022-11-21 13:46:15,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2022-11-21 13:46:15,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2022-11-21 13:46:15,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2022-11-21 13:46:15,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2022-11-21 13:46:15,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2022-11-21 13:46:15,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2022-11-21 13:46:15,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2022-11-21 13:46:15,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2022-11-21 13:46:15,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2022-11-21 13:46:15,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2022-11-21 13:46:15,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2022-11-21 13:46:15,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2022-11-21 13:46:15,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2022-11-21 13:46:15,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2022-11-21 13:46:15,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2022-11-21 13:46:15,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2022-11-21 13:46:15,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2022-11-21 13:46:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2022-11-21 13:46:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2022-11-21 13:46:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2022-11-21 13:46:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2022-11-21 13:46:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2022-11-21 13:46:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2022-11-21 13:46:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2022-11-21 13:46:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2022-11-21 13:46:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2022-11-21 13:46:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2022-11-21 13:46:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2022-11-21 13:46:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2022-11-21 13:46:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2022-11-21 13:46:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2022-11-21 13:46:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2022-11-21 13:46:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2022-11-21 13:46:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2022-11-21 13:46:15,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2022-11-21 13:46:15,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2022-11-21 13:46:15,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2022-11-21 13:46:15,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2022-11-21 13:46:15,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2022-11-21 13:46:15,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2022-11-21 13:46:15,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2022-11-21 13:46:15,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2022-11-21 13:46:15,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2022-11-21 13:46:15,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2022-11-21 13:46:15,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2022-11-21 13:46:15,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2022-11-21 13:46:15,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2022-11-21 13:46:15,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2022-11-21 13:46:15,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2022-11-21 13:46:15,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2022-11-21 13:46:15,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2022-11-21 13:46:15,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2022-11-21 13:46:15,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2022-11-21 13:46:15,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2022-11-21 13:46:15,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2022-11-21 13:46:15,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2022-11-21 13:46:15,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2022-11-21 13:46:15,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2022-11-21 13:46:15,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2022-11-21 13:46:15,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2022-11-21 13:46:15,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2022-11-21 13:46:15,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2022-11-21 13:46:15,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2022-11-21 13:46:15,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2022-11-21 13:46:15,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2022-11-21 13:46:15,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2022-11-21 13:46:15,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2022-11-21 13:46:15,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2022-11-21 13:46:15,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2022-11-21 13:46:15,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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 (19)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:15,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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-21 13:46:15,295 INFO L444 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:15,299 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 13:46:15,299 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 13:46:15,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:46:15 BasicIcfg [2022-11-21 13:46:15,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 13:46:15,423 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 13:46:15,423 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 13:46:15,423 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 13:46:15,424 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:44:49" (3/4) ... [2022-11-21 13:46:15,426 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 13:46:15,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 13:46:15,427 INFO L158 Benchmark]: Toolchain (without parser) took 88705.05ms. Allocated memory was 90.2MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 67.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 649.9MB. Max. memory is 16.1GB. [2022-11-21 13:46:15,427 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 67.1MB. Free memory is still 45.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:46:15,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 709.83ms. Allocated memory is still 90.2MB. Free memory was 66.8MB in the beginning and 61.2MB in the end (delta: 5.6MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-11-21 13:46:15,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.76ms. Allocated memory is still 90.2MB. Free memory was 61.2MB in the beginning and 58.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:46:15,428 INFO L158 Benchmark]: Boogie Preprocessor took 37.48ms. Allocated memory is still 90.2MB. Free memory was 58.5MB in the beginning and 55.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:46:15,428 INFO L158 Benchmark]: RCFGBuilder took 1897.31ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.7MB in the beginning and 40.0MB in the end (delta: 15.8MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2022-11-21 13:46:15,429 INFO L158 Benchmark]: TraceAbstraction took 85972.49ms. Allocated memory was 109.1MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 39.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 602.3MB. Max. memory is 16.1GB. [2022-11-21 13:46:15,429 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 2.7GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:46:15,430 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.24ms. Allocated memory is still 67.1MB. Free memory is still 45.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 709.83ms. Allocated memory is still 90.2MB. Free memory was 66.8MB in the beginning and 61.2MB in the end (delta: 5.6MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.76ms. Allocated memory is still 90.2MB. Free memory was 61.2MB in the beginning and 58.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.48ms. Allocated memory is still 90.2MB. Free memory was 58.5MB in the beginning and 55.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1897.31ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.7MB in the beginning and 40.0MB in the end (delta: 15.8MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * TraceAbstraction took 85972.49ms. Allocated memory was 109.1MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 39.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 602.3MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 2.7GB. Free memory is still 2.0GB. 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: 49.9s, 205 PlacesBefore, 100 PlacesAfterwards, 197 TransitionsBefore, 91 TransitionsAfterwards, 9024 CoEnabledTransitionPairs, 8 FixpointIterations, 74 TrivialSequentialCompositions, 119 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 201 TotalNumberOfCompositions, 45142 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19004, independent: 18390, independent conditional: 0, independent unconditional: 18390, dependent: 558, dependent conditional: 0, dependent unconditional: 558, unknown: 56, unknown conditional: 0, unknown unconditional: 56] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6571, independent: 6460, independent conditional: 0, independent unconditional: 6460, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6571, independent: 4952, independent conditional: 0, independent unconditional: 4952, dependent: 1619, dependent conditional: 0, dependent unconditional: 1619, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1619, independent: 1508, independent conditional: 0, independent unconditional: 1508, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7644, independent: 6090, independent conditional: 0, independent unconditional: 6090, dependent: 1338, dependent conditional: 0, dependent unconditional: 1338, unknown: 216, unknown conditional: 0, unknown unconditional: 216] ], Cache Queries: [ total: 19004, independent: 11930, independent conditional: 0, independent unconditional: 11930, dependent: 455, dependent conditional: 0, dependent unconditional: 455, unknown: 6619, unknown conditional: 0, unknown unconditional: 6619] , Statistics on independence cache: Total cache size (in pairs): 1090, Positive cache size: 1039, Positive conditional cache size: 0, Positive unconditional cache size: 1039, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2381; [L855] FCALL, FORK 0 pthread_create(&t2381, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2381, ((void *)0), P0, ((void *)0))=0, t2381={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L856] 0 pthread_t t2382; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2381={15:0}, t2382={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L857] FCALL, FORK 0 pthread_create(&t2382, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2382, ((void *)0), P1, ((void *)0))=1, t2381={15:0}, t2382={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L858] 0 pthread_t t2383; [L859] FCALL, FORK 0 pthread_create(&t2383, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2383, ((void *)0), P2, ((void *)0))=2, t2381={15:0}, t2382={5:0}, t2383={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L829] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L761] 1 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !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) [L770] EXPR 1 \read(x) [L770] EXPR 1 !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) [L770] 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) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 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)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 \read(x) [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L794] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 \read(x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] 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) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L865] EXPR 0 \read(x) [L865] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 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) [L866] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L867] 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 [L868] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L869] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2381={15:0}, t2382={5:0}, t2383={7:0}, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 x$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(x) [L875] 0 x$mem_tmp = x [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 \read(x) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L877] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L878] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L879] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L880] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L882] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L884] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L884] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L885] EXPR 0 \read(x) [L885] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L886] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L886] 0 x = x$flush_delayed ? x$mem_tmp : x [L887] 0 x$flush_delayed = (_Bool)0 [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=2, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 857]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 258 locations, 101 error locations. Started 1 CEGAR loops. OverallTime: 85.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.4s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 53.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 471 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 471 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1914 IncrementalHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 87 mSDtfsCounter, 1914 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119052occurred in iteration=0, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 914 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 6497 SizeOfPredicates, 66 NumberOfNonLiveVariables, 3059 ConjunctsInSsa, 261 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 13:46:15,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bab8ced-505e-41c4-86bb-c5dc0be88dbf/bin/uautomizer-vX5HgA9Q3a/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