./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe028_power.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_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe028_power.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 0d78821bc3a287b999f98be361d707254bd2fa61b63b525cf42d392168336d80
--- 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 16:31:26,465 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-21 16:31:26,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-21 16:31:26,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-21 16:31:26,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-21 16:31:26,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-21 16:31:26,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-21 16:31:26,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-21 16:31:26,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-21 16:31:26,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-21 16:31:26,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-21 16:31:26,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-21 16:31:26,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-21 16:31:26,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-21 16:31:26,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-21 16:31:26,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-21 16:31:26,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-21 16:31:26,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-21 16:31:26,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-21 16:31:26,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-21 16:31:26,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-21 16:31:26,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-21 16:31:26,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-21 16:31:26,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-21 16:31:26,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-21 16:31:26,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-21 16:31:26,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-21 16:31:26,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-21 16:31:26,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-21 16:31:26,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-21 16:31:26,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-21 16:31:26,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-21 16:31:26,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-21 16:31:26,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-21 16:31:26,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-21 16:31:26,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-21 16:31:26,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-21 16:31:26,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-21 16:31:26,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-21 16:31:26,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-21 16:31:26,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-21 16:31:26,578 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2022-11-21 16:31:26,608 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-21 16:31:26,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-21 16:31:26,609 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-21 16:31:26,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-21 16:31:26,610 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-21 16:31:26,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-21 16:31:26,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-21 16:31:26,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-21 16:31:26,612 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-21 16:31:26,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-21 16:31:26,613 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-21 16:31:26,614 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2022-11-21 16:31:26,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-11-21 16:31:26,614 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-21 16:31:26,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-21 16:31:26,614 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2022-11-21 16:31:26,615 INFO L138 SettingsManager]: * Bitprecise bitfields=true
[2022-11-21 16:31:26,615 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2022-11-21 16:31:26,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-21 16:31:26,615 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2022-11-21 16:31:26,616 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-21 16:31:26,616 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-21 16:31:26,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-21 16:31:26,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-21 16:31:26,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-21 16:31:26,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-21 16:31:26,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-21 16:31:26,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-21 16:31:26,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-11-21 16:31:26,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-11-21 16:31:26,618 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_82f77afa-a5fb-4635-b904-0619dcb9fec3/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_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 -> 0d78821bc3a287b999f98be361d707254bd2fa61b63b525cf42d392168336d80
[2022-11-21 16:31:26,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-21 16:31:26,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-21 16:31:26,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-21 16:31:26,981 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-21 16:31:26,983 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-21 16:31:26,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe028_power.i
[2022-11-21 16:31:30,213 INFO L500 CDTParser]: Created temporary CDT project at NULL
[2022-11-21 16:31:30,486 INFO L351 CDTParser]: Found 1 translation units.
[2022-11-21 16:31:30,492 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/sv-benchmarks/c/pthread-wmm/safe028_power.i
[2022-11-21 16:31:30,552 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/data/0a5bf7982/d162afb9f21d4c3fb61932294ff557d7/FLAG25af18f90
[2022-11-21 16:31:30,573 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/data/0a5bf7982/d162afb9f21d4c3fb61932294ff557d7
[2022-11-21 16:31:30,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-21 16:31:30,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-21 16:31:30,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-21 16:31:30,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-21 16:31:30,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-21 16:31:30,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:31:30" (1/1) ...
[2022-11-21 16:31:30,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6c971f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:30, skipping insertion in model container
[2022-11-21 16:31:30,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:31:30" (1/1) ...
[2022-11-21 16:31:30,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-21 16:31:30,666 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-21 16:31:30,899 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_82f77afa-a5fb-4635-b904-0619dcb9fec3/sv-benchmarks/c/pthread-wmm/safe028_power.i[990,1003]
[2022-11-21 16:31:31,138 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-21 16:31:31,151 INFO L203 MainTranslator]: Completed pre-run
[2022-11-21 16:31:31,163 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_82f77afa-a5fb-4635-b904-0619dcb9fec3/sv-benchmarks/c/pthread-wmm/safe028_power.i[990,1003]
[2022-11-21 16:31:31,216 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-21 16:31:31,253 INFO L208 MainTranslator]: Completed translation
[2022-11-21 16:31:31,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31 WrapperNode
[2022-11-21 16:31:31,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-21 16:31:31,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-21 16:31:31,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-21 16:31:31,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-21 16:31:31,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31" (1/1) ...
[2022-11-21 16:31:31,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31" (1/1) ...
[2022-11-21 16:31:31,349 INFO L138 Inliner]: procedures = 176, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177
[2022-11-21 16:31:31,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-21 16:31:31,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-21 16:31:31,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-21 16:31:31,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-21 16:31:31,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31" (1/1) ...
[2022-11-21 16:31:31,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31" (1/1) ...
[2022-11-21 16:31:31,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31" (1/1) ...
[2022-11-21 16:31:31,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31" (1/1) ...
[2022-11-21 16:31:31,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31" (1/1) ...
[2022-11-21 16:31:31,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31" (1/1) ...
[2022-11-21 16:31:31,408 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31" (1/1) ...
[2022-11-21 16:31:31,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31" (1/1) ...
[2022-11-21 16:31:31,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-21 16:31:31,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-21 16:31:31,429 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-21 16:31:31,429 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-21 16:31:31,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31" (1/1) ...
[2022-11-21 16:31:31,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-21 16:31:31,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/z3
[2022-11-21 16:31:31,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-21 16:31:31,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-21 16:31:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-11-21 16:31:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-11-21 16:31:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-11-21 16:31:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-21 16:31:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-11-21 16:31:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-11-21 16:31:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2022-11-21 16:31:31,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2022-11-21 16:31:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2022-11-21 16:31:31,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2022-11-21 16:31:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2022-11-21 16:31:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2022-11-21 16:31:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-21 16:31:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-11-21 16:31:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-21 16:31:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-21 16:31:31,536 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 16:31:31,760 INFO L235 CfgBuilder]: Building ICFG
[2022-11-21 16:31:31,762 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-21 16:31:32,544 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-21 16:31:33,302 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-21 16:31:33,302 INFO L300 CfgBuilder]: Removed 0 assume(true) statements.
[2022-11-21 16:31:33,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:31:33 BoogieIcfgContainer
[2022-11-21 16:31:33,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-21 16:31:33,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-21 16:31:33,309 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-21 16:31:33,312 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-21 16:31:33,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:31:30" (1/3) ...
[2022-11-21 16:31:33,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f3b73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:31:33, skipping insertion in model container
[2022-11-21 16:31:33,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:31" (2/3) ...
[2022-11-21 16:31:33,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f3b73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:31:33, skipping insertion in model container
[2022-11-21 16:31:33,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:31:33" (3/3) ...
[2022-11-21 16:31:33,318 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_power.i
[2022-11-21 16:31:33,340 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-21 16:31:33,340 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations.
[2022-11-21 16:31:33,340 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-11-21 16:31:33,527 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-11-21 16:31:33,583 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-11-21 16:31:33,607 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 184 transitions, 383 flow
[2022-11-21 16:31:33,612 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 184 transitions, 383 flow
[2022-11-21 16:31:33,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 184 transitions, 383 flow
[2022-11-21 16:31:33,789 INFO L130 PetriNetUnfolder]: 2/181 cut-off events.
[2022-11-21 16:31:33,790 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-11-21 16:31:33,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 181 events. 2/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 294 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place.
[2022-11-21 16:31:33,804 INFO L119 LiptonReduction]: Number of co-enabled transitions 7512
[2022-11-21 16:31:53,228 INFO L134 LiptonReduction]: Checked pairs total: 30566
[2022-11-21 16:31:53,229 INFO L136 LiptonReduction]: Total number of compositions: 163
[2022-11-21 16:31:53,238 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 79 transitions, 173 flow
[2022-11-21 16:31:55,311 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 0 states 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 16:31:55,345 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-21 16:31:55,354 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;@7491e9cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-21 16:31:55,354 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations.
[2022-11-21 16:31:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 0 states 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 16:31:55,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2
[2022-11-21 16:31:55,439 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:31:55,440 INFO L195 NwaCegarLoop]: trace histogram [1]
[2022-11-21 16:31:55,441 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:31:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1172, now seen corresponding path program 1 times
[2022-11-21 16:31:55,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:55,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512542264]
[2022-11-21 16:31:55,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:55,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:55,621 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 16:31:55,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:55,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512542264]
[2022-11-21 16:31:55,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512542264] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:55,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:55,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2022-11-21 16:31:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295282159]
[2022-11-21 16:31:55,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:55,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-11-21 16:31:55,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:55,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-11-21 16:31:55,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-11-21 16:31:55,739 INFO L87 Difference]: Start difference. First operand has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 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 16:31:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:31:56,136 INFO L93 Difference]: Finished difference Result 9084 states and 32205 transitions.
[2022-11-21 16:31:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-11-21 16:31:56,139 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 16:31:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:31:56,276 INFO L225 Difference]: With dead ends: 9084
[2022-11-21 16:31:56,277 INFO L226 Difference]: Without dead ends: 9084
[2022-11-21 16:31:56,278 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 16:31:56,282 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-11-21 16:31:56,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-11-21 16:31:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states.
[2022-11-21 16:31:56,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 9084.
[2022-11-21 16:31:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9084 states, 7951 states have (on average 4.050433907684568) internal successors, (32205), 9083 states have internal predecessors, (32205), 0 states have call successors, (0), 0 states 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 16:31:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9084 states to 9084 states and 32205 transitions.
[2022-11-21 16:31:56,885 INFO L78 Accepts]: Start accepts. Automaton has 9084 states and 32205 transitions. Word has length 1
[2022-11-21 16:31:56,885 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:31:56,885 INFO L495 AbstractCegarLoop]: Abstraction has 9084 states and 32205 transitions.
[2022-11-21 16:31:56,886 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 16:31:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 9084 states and 32205 transitions.
[2022-11-21 16:31:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2022-11-21 16:31:56,887 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:31:56,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2022-11-21 16:31:56,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-11-21 16:31:56,888 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:31:56,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash 35947374, now seen corresponding path program 1 times
[2022-11-21 16:31:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:56,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263472564]
[2022-11-21 16:31:56,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:56,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:57,214 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 16:31:57,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:57,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263472564]
[2022-11-21 16:31:57,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263472564] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:57,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:57,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2022-11-21 16:31:57,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920135696]
[2022-11-21 16:31:57,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:57,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-21 16:31:57,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:57,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-21 16:31:57,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:31:57,222 INFO L87 Difference]: Start difference. First operand 9084 states and 32205 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 16:31:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:31:57,688 INFO L93 Difference]: Finished difference Result 6818 states and 22177 transitions.
[2022-11-21 16:31:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-21 16:31:57,689 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 16:31:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:31:57,751 INFO L225 Difference]: With dead ends: 6818
[2022-11-21 16:31:57,752 INFO L226 Difference]: Without dead ends: 6818
[2022-11-21 16:31:57,752 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 16:31:57,753 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-11-21 16:31:57,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-11-21 16:31:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6818 states.
[2022-11-21 16:31:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6818 to 6090.
[2022-11-21 16:31:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6090 states, 5679 states have (on average 3.729705934143335) internal successors, (21181), 6089 states have internal predecessors, (21181), 0 states have call successors, (0), 0 states 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 16:31:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 21181 transitions.
[2022-11-21 16:31:58,251 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 21181 transitions. Word has length 4
[2022-11-21 16:31:58,252 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:31:58,252 INFO L495 AbstractCegarLoop]: Abstraction has 6090 states and 21181 transitions.
[2022-11-21 16:31:58,267 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 16:31:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 21181 transitions.
[2022-11-21 16:31:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2022-11-21 16:31:58,269 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:31:58,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2022-11-21 16:31:58,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-11-21 16:31:58,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:31:58,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash 35947375, now seen corresponding path program 1 times
[2022-11-21 16:31:58,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:58,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456102030]
[2022-11-21 16:31:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:58,567 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 16:31:58,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:58,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456102030]
[2022-11-21 16:31:58,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456102030] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:58,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:58,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2022-11-21 16:31:58,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731934698]
[2022-11-21 16:31:58,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:58,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-21 16:31:58,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:58,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-21 16:31:58,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:31:58,570 INFO L87 Difference]: Start difference. First operand 6090 states and 21181 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 16:31:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:31:58,723 INFO L93 Difference]: Finished difference Result 2502 states and 7903 transitions.
[2022-11-21 16:31:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-21 16:31:58,724 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 16:31:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:31:58,736 INFO L225 Difference]: With dead ends: 2502
[2022-11-21 16:31:58,751 INFO L226 Difference]: Without dead ends: 2452
[2022-11-21 16:31:58,751 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 16:31:58,752 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-11-21 16:31:58,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-11-21 16:31:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states.
[2022-11-21 16:31:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2452.
[2022-11-21 16:31:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2383 states have (on average 3.2459085186739403) internal successors, (7735), 2451 states have internal predecessors, (7735), 0 states have call successors, (0), 0 states 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 16:31:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 7735 transitions.
[2022-11-21 16:31:58,855 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 7735 transitions. Word has length 4
[2022-11-21 16:31:58,856 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:31:58,856 INFO L495 AbstractCegarLoop]: Abstraction has 2452 states and 7735 transitions.
[2022-11-21 16:31:58,856 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 16:31:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 7735 transitions.
[2022-11-21 16:31:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2022-11-21 16:31:58,857 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:31:58,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2022-11-21 16:31:58,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-11-21 16:31:58,858 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:31:58,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:58,859 INFO L85 PathProgramCache]: Analyzing trace with hash 186766819, now seen corresponding path program 1 times
[2022-11-21 16:31:58,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:58,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755638277]
[2022-11-21 16:31:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:58,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:59,142 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 16:31:59,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:59,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755638277]
[2022-11-21 16:31:59,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755638277] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:59,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:59,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2022-11-21 16:31:59,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123885272]
[2022-11-21 16:31:59,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:59,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-21 16:31:59,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:59,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-21 16:31:59,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:31:59,151 INFO L87 Difference]: Start difference. First operand 2452 states and 7735 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states 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 16:31:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:31:59,416 INFO L93 Difference]: Finished difference Result 2076 states and 6397 transitions.
[2022-11-21 16:31:59,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-21 16:31:59,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6
[2022-11-21 16:31:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:31:59,430 INFO L225 Difference]: With dead ends: 2076
[2022-11-21 16:31:59,430 INFO L226 Difference]: Without dead ends: 2058
[2022-11-21 16:31:59,431 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 16:31:59,434 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-11-21 16:31:59,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-11-21 16:31:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states.
[2022-11-21 16:31:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058.
[2022-11-21 16:31:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2008 states have (on average 3.1658366533864544) internal successors, (6357), 2057 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states 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 16:31:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 6357 transitions.
[2022-11-21 16:31:59,547 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 6357 transitions. Word has length 6
[2022-11-21 16:31:59,548 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:31:59,548 INFO L495 AbstractCegarLoop]: Abstraction has 2058 states and 6357 transitions.
[2022-11-21 16:31:59,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states 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 16:31:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 6357 transitions.
[2022-11-21 16:31:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2022-11-21 16:31:59,551 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:31:59,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:31:59,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-11-21 16:31:59,552 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:31:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1564456649, now seen corresponding path program 1 times
[2022-11-21 16:31:59,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:59,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30659568]
[2022-11-21 16:31:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:59,819 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 16:31:59,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:59,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30659568]
[2022-11-21 16:31:59,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30659568] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:59,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:59,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2022-11-21 16:31:59,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431944084]
[2022-11-21 16:31:59,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:59,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-21 16:31:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:59,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-21 16:31:59,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:31:59,823 INFO L87 Difference]: Start difference. First operand 2058 states and 6357 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:00,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:00,096 INFO L93 Difference]: Finished difference Result 2026 states and 6245 transitions.
[2022-11-21 16:32:00,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-21 16:32:00,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2022-11-21 16:32:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:00,108 INFO L225 Difference]: With dead ends: 2026
[2022-11-21 16:32:00,123 INFO L226 Difference]: Without dead ends: 2026
[2022-11-21 16:32:00,124 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 16:32:00,125 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:00,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-11-21 16:32:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states.
[2022-11-21 16:32:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026.
[2022-11-21 16:32:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 1976 states have (on average 3.160425101214575) internal successors, (6245), 2025 states have internal predecessors, (6245), 0 states have call successors, (0), 0 states 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 16:32:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 6245 transitions.
[2022-11-21 16:32:00,249 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 6245 transitions. Word has length 10
[2022-11-21 16:32:00,250 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:00,250 INFO L495 AbstractCegarLoop]: Abstraction has 2026 states and 6245 transitions.
[2022-11-21 16:32:00,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 6245 transitions.
[2022-11-21 16:32:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2022-11-21 16:32:00,254 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:00,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:00,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-11-21 16:32:00,255 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:00,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1253434405, now seen corresponding path program 1 times
[2022-11-21 16:32:00,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:00,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542815707]
[2022-11-21 16:32:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:00,559 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 16:32:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:00,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542815707]
[2022-11-21 16:32:00,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542815707] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:00,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:00,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-21 16:32:00,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625624859]
[2022-11-21 16:32:00,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:00,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-21 16:32:00,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:00,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-21 16:32:00,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:32:00,563 INFO L87 Difference]: Start difference. First operand 2026 states and 6245 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:00,717 INFO L93 Difference]: Finished difference Result 2290 states and 6877 transitions.
[2022-11-21 16:32:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-21 16:32:00,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11
[2022-11-21 16:32:00,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:00,732 INFO L225 Difference]: With dead ends: 2290
[2022-11-21 16:32:00,733 INFO L226 Difference]: Without dead ends: 2290
[2022-11-21 16:32:00,733 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 16:32:00,734 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:00,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-11-21 16:32:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states.
[2022-11-21 16:32:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 1962.
[2022-11-21 16:32:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1913 states have (on average 3.1557762676424463) internal successors, (6037), 1961 states have internal predecessors, (6037), 0 states have call successors, (0), 0 states 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 16:32:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 6037 transitions.
[2022-11-21 16:32:00,803 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 6037 transitions. Word has length 11
[2022-11-21 16:32:00,803 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:00,804 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 6037 transitions.
[2022-11-21 16:32:00,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 6037 transitions.
[2022-11-21 16:32:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2022-11-21 16:32:00,805 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:00,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:00,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-11-21 16:32:00,806 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:00,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1253434406, now seen corresponding path program 1 times
[2022-11-21 16:32:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:00,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138095324]
[2022-11-21 16:32:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:00,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:01,199 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 16:32:01,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:01,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138095324]
[2022-11-21 16:32:01,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138095324] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:01,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:01,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-21 16:32:01,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982720940]
[2022-11-21 16:32:01,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:01,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-21 16:32:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:01,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-21 16:32:01,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2022-11-21 16:32:01,207 INFO L87 Difference]: Start difference. First operand 1962 states and 6037 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:01,359 INFO L93 Difference]: Finished difference Result 1898 states and 5829 transitions.
[2022-11-21 16:32:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-21 16:32:01,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11
[2022-11-21 16:32:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:01,371 INFO L225 Difference]: With dead ends: 1898
[2022-11-21 16:32:01,371 INFO L226 Difference]: Without dead ends: 1898
[2022-11-21 16:32:01,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2022-11-21 16:32:01,373 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:01,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-11-21 16:32:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states.
[2022-11-21 16:32:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898.
[2022-11-21 16:32:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1850 states have (on average 3.150810810810811) internal successors, (5829), 1897 states have internal predecessors, (5829), 0 states have call successors, (0), 0 states 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 16:32:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 5829 transitions.
[2022-11-21 16:32:01,436 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 5829 transitions. Word has length 11
[2022-11-21 16:32:01,437 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:01,437 INFO L495 AbstractCegarLoop]: Abstraction has 1898 states and 5829 transitions.
[2022-11-21 16:32:01,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 5829 transitions.
[2022-11-21 16:32:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2022-11-21 16:32:01,438 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:01,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:01,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-11-21 16:32:01,439 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:01,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:01,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1253512147, now seen corresponding path program 1 times
[2022-11-21 16:32:01,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:01,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158538930]
[2022-11-21 16:32:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:01,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:01,799 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 16:32:01,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:01,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158538930]
[2022-11-21 16:32:01,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158538930] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:01,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:01,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2022-11-21 16:32:01,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700718190]
[2022-11-21 16:32:01,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:01,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-21 16:32:01,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:01,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-21 16:32:01,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:32:01,808 INFO L87 Difference]: Start difference. First operand 1898 states and 5829 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 16:32:01,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:01,937 INFO L93 Difference]: Finished difference Result 1882 states and 5773 transitions.
[2022-11-21 16:32:01,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-21 16:32:01,937 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 16:32:01,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:01,948 INFO L225 Difference]: With dead ends: 1882
[2022-11-21 16:32:01,948 INFO L226 Difference]: Without dead ends: 1882
[2022-11-21 16:32:01,949 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 16:32:01,952 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:01,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-11-21 16:32:01,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states.
[2022-11-21 16:32:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882.
[2022-11-21 16:32:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1834 states have (on average 3.147764449291167) internal successors, (5773), 1881 states have internal predecessors, (5773), 0 states have call successors, (0), 0 states 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 16:32:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 5773 transitions.
[2022-11-21 16:32:02,014 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 5773 transitions. Word has length 11
[2022-11-21 16:32:02,014 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:02,014 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 5773 transitions.
[2022-11-21 16:32:02,015 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 16:32:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 5773 transitions.
[2022-11-21 16:32:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-11-21 16:32:02,019 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:02,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:02,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-11-21 16:32:02,019 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:02,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:02,020 INFO L85 PathProgramCache]: Analyzing trace with hash 201757175, now seen corresponding path program 1 times
[2022-11-21 16:32:02,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:02,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330390542]
[2022-11-21 16:32:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:03,924 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 16:32:03,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:03,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330390542]
[2022-11-21 16:32:03,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330390542] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:03,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:03,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-21 16:32:03,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465510773]
[2022-11-21 16:32:03,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:03,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-11-21 16:32:03,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:03,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-11-21 16:32:03,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2022-11-21 16:32:03,928 INFO L87 Difference]: Start difference. First operand 1882 states and 5773 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 16:32:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:04,638 INFO L93 Difference]: Finished difference Result 2194 states and 6849 transitions.
[2022-11-21 16:32:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-11-21 16:32:04,639 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 16:32:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:04,653 INFO L225 Difference]: With dead ends: 2194
[2022-11-21 16:32:04,653 INFO L226 Difference]: Without dead ends: 2194
[2022-11-21 16:32:04,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132
[2022-11-21 16:32:04,656 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 83 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:04,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 13 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-11-21 16:32:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states.
[2022-11-21 16:32:04,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 1898.
[2022-11-21 16:32:04,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1850 states have (on average 3.152972972972973) internal successors, (5833), 1897 states have internal predecessors, (5833), 0 states have call successors, (0), 0 states 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 16:32:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 5833 transitions.
[2022-11-21 16:32:04,748 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 5833 transitions. Word has length 12
[2022-11-21 16:32:04,748 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:04,748 INFO L495 AbstractCegarLoop]: Abstraction has 1898 states and 5833 transitions.
[2022-11-21 16:32:04,749 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 16:32:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 5833 transitions.
[2022-11-21 16:32:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2022-11-21 16:32:04,751 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:04,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:04,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-11-21 16:32:04,752 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:04,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:04,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1703794253, now seen corresponding path program 1 times
[2022-11-21 16:32:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:04,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810914569]
[2022-11-21 16:32:04,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:04,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:05,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:05,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810914569]
[2022-11-21 16:32:05,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810914569] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:05,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:05,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-21 16:32:05,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979366883]
[2022-11-21 16:32:05,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:05,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-21 16:32:05,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:05,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-21 16:32:05,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:32:05,084 INFO L87 Difference]: Start difference. First operand 1898 states and 5833 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 16:32:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:05,202 INFO L93 Difference]: Finished difference Result 825 states and 2125 transitions.
[2022-11-21 16:32:05,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-21 16:32:05,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 16:32:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:05,207 INFO L225 Difference]: With dead ends: 825
[2022-11-21 16:32:05,207 INFO L226 Difference]: Without dead ends: 825
[2022-11-21 16:32:05,208 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 16:32:05,208 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:05,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-11-21 16:32:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states.
[2022-11-21 16:32:05,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 821.
[2022-11-21 16:32:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 785 states have (on average 2.69171974522293) internal successors, (2113), 820 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states 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 16:32:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2113 transitions.
[2022-11-21 16:32:05,237 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2113 transitions. Word has length 13
[2022-11-21 16:32:05,237 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:05,237 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 2113 transitions.
[2022-11-21 16:32:05,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 16:32:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2113 transitions.
[2022-11-21 16:32:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2022-11-21 16:32:05,239 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:05,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:05,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-11-21 16:32:05,240 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1152888263, now seen corresponding path program 1 times
[2022-11-21 16:32:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:05,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532140418]
[2022-11-21 16:32:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:05,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:05,844 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 16:32:05,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:05,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532140418]
[2022-11-21 16:32:05,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532140418] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:05,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:05,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-21 16:32:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767623798]
[2022-11-21 16:32:05,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:05,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-21 16:32:05,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:05,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-21 16:32:05,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2022-11-21 16:32:05,848 INFO L87 Difference]: Start difference. First operand 821 states and 2113 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:06,005 INFO L93 Difference]: Finished difference Result 259 states and 546 transitions.
[2022-11-21 16:32:06,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-21 16:32:06,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2022-11-21 16:32:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:06,007 INFO L225 Difference]: With dead ends: 259
[2022-11-21 16:32:06,008 INFO L226 Difference]: Without dead ends: 259
[2022-11-21 16:32:06,008 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 16:32:06,009 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:06,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-11-21 16:32:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states.
[2022-11-21 16:32:06,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255.
[2022-11-21 16:32:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 241 states have (on average 2.224066390041494) internal successors, (536), 254 states have internal predecessors, (536), 0 states have call successors, (0), 0 states 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 16:32:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 536 transitions.
[2022-11-21 16:32:06,019 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 536 transitions. Word has length 15
[2022-11-21 16:32:06,019 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:06,019 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 536 transitions.
[2022-11-21 16:32:06,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 536 transitions.
[2022-11-21 16:32:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2022-11-21 16:32:06,021 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:06,021 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 16:32:06,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-11-21 16:32:06,021 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:06,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:06,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1570824566, now seen corresponding path program 1 times
[2022-11-21 16:32:06,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:06,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785453803]
[2022-11-21 16:32:06,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:06,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:06,844 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 16:32:06,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:06,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785453803]
[2022-11-21 16:32:06,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785453803] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:06,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:06,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-21 16:32:06,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100143027]
[2022-11-21 16:32:06,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:06,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-11-21 16:32:06,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:06,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-21 16:32:06,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2022-11-21 16:32:06,847 INFO L87 Difference]: Start difference. First operand 255 states and 536 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 16:32:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:06,991 INFO L93 Difference]: Finished difference Result 149 states and 334 transitions.
[2022-11-21 16:32:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-11-21 16:32:06,991 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 16:32:06,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:06,992 INFO L225 Difference]: With dead ends: 149
[2022-11-21 16:32:06,992 INFO L226 Difference]: Without dead ends: 149
[2022-11-21 16:32:06,993 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 16:32:06,993 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:06,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-11-21 16:32:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2022-11-21 16:32:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149.
[2022-11-21 16:32:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 2.272108843537415) internal successors, (334), 148 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 334 transitions.
[2022-11-21 16:32:06,997 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 334 transitions. Word has length 18
[2022-11-21 16:32:06,997 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:06,998 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 334 transitions.
[2022-11-21 16:32:06,998 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 16:32:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 334 transitions.
[2022-11-21 16:32:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-11-21 16:32:06,998 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:06,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:06,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-11-21 16:32:07,000 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:07,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash -691354408, now seen corresponding path program 1 times
[2022-11-21 16:32:07,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:07,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247450050]
[2022-11-21 16:32:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:07,325 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 16:32:07,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:07,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247450050]
[2022-11-21 16:32:07,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247450050] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:07,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:07,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-21 16:32:07,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189831258]
[2022-11-21 16:32:07,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:07,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-21 16:32:07,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:07,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-21 16:32:07,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-21 16:32:07,328 INFO L87 Difference]: Start difference. First operand 149 states and 334 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:07,472 INFO L93 Difference]: Finished difference Result 191 states and 415 transitions.
[2022-11-21 16:32:07,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-21 16:32:07,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21
[2022-11-21 16:32:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:07,474 INFO L225 Difference]: With dead ends: 191
[2022-11-21 16:32:07,474 INFO L226 Difference]: Without dead ends: 191
[2022-11-21 16:32:07,474 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 16:32:07,475 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:07,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-11-21 16:32:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2022-11-21 16:32:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187.
[2022-11-21 16:32:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 2.227027027027027) internal successors, (412), 186 states have internal predecessors, (412), 0 states have call successors, (0), 0 states 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 16:32:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 412 transitions.
[2022-11-21 16:32:07,480 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 412 transitions. Word has length 21
[2022-11-21 16:32:07,480 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:07,480 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 412 transitions.
[2022-11-21 16:32:07,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 412 transitions.
[2022-11-21 16:32:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-11-21 16:32:07,481 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:07,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:07,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-11-21 16:32:07,481 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:07,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1393710906, now seen corresponding path program 2 times
[2022-11-21 16:32:07,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:07,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532195316]
[2022-11-21 16:32:07,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:07,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:11,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:11,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532195316]
[2022-11-21 16:32:11,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532195316] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:11,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:11,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-11-21 16:32:11,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898585319]
[2022-11-21 16:32:11,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:11,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-11-21 16:32:11,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:11,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-11-21 16:32:11,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-11-21 16:32:11,373 INFO L87 Difference]: Start difference. First operand 187 states and 412 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:12,368 INFO L93 Difference]: Finished difference Result 453 states and 933 transitions.
[2022-11-21 16:32:12,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-11-21 16:32:12,368 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21
[2022-11-21 16:32:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:12,370 INFO L225 Difference]: With dead ends: 453
[2022-11-21 16:32:12,370 INFO L226 Difference]: Without dead ends: 453
[2022-11-21 16:32:12,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240
[2022-11-21 16:32:12,371 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 67 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:12,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 29 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-11-21 16:32:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states.
[2022-11-21 16:32:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 214.
[2022-11-21 16:32:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 2.259433962264151) internal successors, (479), 213 states have internal predecessors, (479), 0 states have call successors, (0), 0 states 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 16:32:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 479 transitions.
[2022-11-21 16:32:12,378 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 479 transitions. Word has length 21
[2022-11-21 16:32:12,378 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:12,378 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 479 transitions.
[2022-11-21 16:32:12,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 479 transitions.
[2022-11-21 16:32:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-11-21 16:32:12,379 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:12,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:12,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-11-21 16:32:12,380 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:12,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:12,380 INFO L85 PathProgramCache]: Analyzing trace with hash -328795322, now seen corresponding path program 3 times
[2022-11-21 16:32:12,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:12,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124436087]
[2022-11-21 16:32:12,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:12,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:16,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124436087]
[2022-11-21 16:32:16,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124436087] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:16,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:16,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-21 16:32:16,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173189566]
[2022-11-21 16:32:16,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:16,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-11-21 16:32:16,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:16,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-11-21 16:32:16,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2022-11-21 16:32:16,174 INFO L87 Difference]: Start difference. First operand 214 states and 479 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:17,037 INFO L93 Difference]: Finished difference Result 401 states and 831 transitions.
[2022-11-21 16:32:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-11-21 16:32:17,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21
[2022-11-21 16:32:17,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:17,040 INFO L225 Difference]: With dead ends: 401
[2022-11-21 16:32:17,040 INFO L226 Difference]: Without dead ends: 401
[2022-11-21 16:32:17,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182
[2022-11-21 16:32:17,041 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:17,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 23 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-11-21 16:32:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states.
[2022-11-21 16:32:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 202.
[2022-11-21 16:32:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 2.245) internal successors, (449), 201 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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 16:32:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 449 transitions.
[2022-11-21 16:32:17,048 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 449 transitions. Word has length 21
[2022-11-21 16:32:17,048 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:17,048 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 449 transitions.
[2022-11-21 16:32:17,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 449 transitions.
[2022-11-21 16:32:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-11-21 16:32:17,049 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:17,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:17,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-11-21 16:32:17,050 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash -663993438, now seen corresponding path program 4 times
[2022-11-21 16:32:17,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:17,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966047828]
[2022-11-21 16:32:17,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:21,675 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 16:32:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:21,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966047828]
[2022-11-21 16:32:21,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966047828] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:21,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:21,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-11-21 16:32:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130729612]
[2022-11-21 16:32:21,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:21,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-11-21 16:32:21,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:21,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-11-21 16:32:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156
[2022-11-21 16:32:21,677 INFO L87 Difference]: Start difference. First operand 202 states and 449 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:22,556 INFO L93 Difference]: Finished difference Result 337 states and 737 transitions.
[2022-11-21 16:32:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-11-21 16:32:22,556 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21
[2022-11-21 16:32:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:22,557 INFO L225 Difference]: With dead ends: 337
[2022-11-21 16:32:22,557 INFO L226 Difference]: Without dead ends: 337
[2022-11-21 16:32:22,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210
[2022-11-21 16:32:22,559 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 40 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:22,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 38 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-11-21 16:32:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states.
[2022-11-21 16:32:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 214.
[2022-11-21 16:32:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 2.2735849056603774) internal successors, (482), 213 states have internal predecessors, (482), 0 states have call successors, (0), 0 states 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 16:32:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 482 transitions.
[2022-11-21 16:32:22,576 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 482 transitions. Word has length 21
[2022-11-21 16:32:22,576 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:22,576 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 482 transitions.
[2022-11-21 16:32:22,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 482 transitions.
[2022-11-21 16:32:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-11-21 16:32:22,579 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:22,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:22,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-11-21 16:32:22,580 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1772888342, now seen corresponding path program 5 times
[2022-11-21 16:32:22,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:22,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519136530]
[2022-11-21 16:32:22,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:22,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:26,314 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 16:32:26,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:26,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519136530]
[2022-11-21 16:32:26,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519136530] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:26,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:26,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-11-21 16:32:26,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848797966]
[2022-11-21 16:32:26,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:26,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-11-21 16:32:26,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:26,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-11-21 16:32:26,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2022-11-21 16:32:26,317 INFO L87 Difference]: Start difference. First operand 214 states and 482 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:32:27,120 INFO L93 Difference]: Finished difference Result 349 states and 752 transitions.
[2022-11-21 16:32:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-11-21 16:32:27,121 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21
[2022-11-21 16:32:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:32:27,122 INFO L225 Difference]: With dead ends: 349
[2022-11-21 16:32:27,122 INFO L226 Difference]: Without dead ends: 349
[2022-11-21 16:32:27,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182
[2022-11-21 16:32:27,123 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-11-21 16:32:27,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 29 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-11-21 16:32:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states.
[2022-11-21 16:32:27,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 208.
[2022-11-21 16:32:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 206 states have (on average 2.266990291262136) internal successors, (467), 207 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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 16:32:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 467 transitions.
[2022-11-21 16:32:27,130 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 467 transitions. Word has length 21
[2022-11-21 16:32:27,131 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:32:27,131 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 467 transitions.
[2022-11-21 16:32:27,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 467 transitions.
[2022-11-21 16:32:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-11-21 16:32:27,132 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:32:27,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:27,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-11-21 16:32:27,133 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:32:27,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:27,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1597229130, now seen corresponding path program 6 times
[2022-11-21 16:32:27,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:27,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922727839]
[2022-11-21 16:32:27,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:27,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-21 16:32:27,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-21 16:32:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-21 16:32:27,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-21 16:32:27,444 INFO L359 BasicCegarLoop]: Counterexample is feasible
[2022-11-21 16:32:27,445 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (90 of 91 remaining)
[2022-11-21 16:32:27,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 91 remaining)
[2022-11-21 16:32:27,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 91 remaining)
[2022-11-21 16:32:27,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 91 remaining)
[2022-11-21 16:32:27,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 91 remaining)
[2022-11-21 16:32:27,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 91 remaining)
[2022-11-21 16:32:27,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 91 remaining)
[2022-11-21 16:32:27,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 91 remaining)
[2022-11-21 16:32:27,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 91 remaining)
[2022-11-21 16:32:27,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 91 remaining)
[2022-11-21 16:32:27,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 91 remaining)
[2022-11-21 16:32:27,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 91 remaining)
[2022-11-21 16:32:27,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 91 remaining)
[2022-11-21 16:32:27,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (77 of 91 remaining)
[2022-11-21 16:32:27,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 91 remaining)
[2022-11-21 16:32:27,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 91 remaining)
[2022-11-21 16:32:27,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 91 remaining)
[2022-11-21 16:32:27,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 91 remaining)
[2022-11-21 16:32:27,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 91 remaining)
[2022-11-21 16:32:27,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 91 remaining)
[2022-11-21 16:32:27,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 91 remaining)
[2022-11-21 16:32:27,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 91 remaining)
[2022-11-21 16:32:27,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 91 remaining)
[2022-11-21 16:32:27,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 91 remaining)
[2022-11-21 16:32:27,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 91 remaining)
[2022-11-21 16:32:27,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 91 remaining)
[2022-11-21 16:32:27,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 91 remaining)
[2022-11-21 16:32:27,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 91 remaining)
[2022-11-21 16:32:27,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 91 remaining)
[2022-11-21 16:32:27,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 91 remaining)
[2022-11-21 16:32:27,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 91 remaining)
[2022-11-21 16:32:27,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 91 remaining)
[2022-11-21 16:32:27,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 91 remaining)
[2022-11-21 16:32:27,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 91 remaining)
[2022-11-21 16:32:27,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 91 remaining)
[2022-11-21 16:32:27,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 91 remaining)
[2022-11-21 16:32:27,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 91 remaining)
[2022-11-21 16:32:27,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 91 remaining)
[2022-11-21 16:32:27,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 91 remaining)
[2022-11-21 16:32:27,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 91 remaining)
[2022-11-21 16:32:27,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 91 remaining)
[2022-11-21 16:32:27,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 91 remaining)
[2022-11-21 16:32:27,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 91 remaining)
[2022-11-21 16:32:27,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 91 remaining)
[2022-11-21 16:32:27,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 91 remaining)
[2022-11-21 16:32:27,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 91 remaining)
[2022-11-21 16:32:27,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 91 remaining)
[2022-11-21 16:32:27,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 91 remaining)
[2022-11-21 16:32:27,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 91 remaining)
[2022-11-21 16:32:27,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 91 remaining)
[2022-11-21 16:32:27,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (40 of 91 remaining)
[2022-11-21 16:32:27,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 91 remaining)
[2022-11-21 16:32:27,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 91 remaining)
[2022-11-21 16:32:27,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 91 remaining)
[2022-11-21 16:32:27,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 91 remaining)
[2022-11-21 16:32:27,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 91 remaining)
[2022-11-21 16:32:27,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 91 remaining)
[2022-11-21 16:32:27,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 91 remaining)
[2022-11-21 16:32:27,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 91 remaining)
[2022-11-21 16:32:27,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 91 remaining)
[2022-11-21 16:32:27,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 91 remaining)
[2022-11-21 16:32:27,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 91 remaining)
[2022-11-21 16:32:27,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 91 remaining)
[2022-11-21 16:32:27,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 91 remaining)
[2022-11-21 16:32:27,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 91 remaining)
[2022-11-21 16:32:27,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 91 remaining)
[2022-11-21 16:32:27,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 91 remaining)
[2022-11-21 16:32:27,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 91 remaining)
[2022-11-21 16:32:27,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 91 remaining)
[2022-11-21 16:32:27,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 91 remaining)
[2022-11-21 16:32:27,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 91 remaining)
[2022-11-21 16:32:27,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 91 remaining)
[2022-11-21 16:32:27,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 91 remaining)
[2022-11-21 16:32:27,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 91 remaining)
[2022-11-21 16:32:27,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 91 remaining)
[2022-11-21 16:32:27,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 91 remaining)
[2022-11-21 16:32:27,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 91 remaining)
[2022-11-21 16:32:27,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 91 remaining)
[2022-11-21 16:32:27,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 91 remaining)
[2022-11-21 16:32:27,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 91 remaining)
[2022-11-21 16:32:27,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 91 remaining)
[2022-11-21 16:32:27,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 91 remaining)
[2022-11-21 16:32:27,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 91 remaining)
[2022-11-21 16:32:27,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 91 remaining)
[2022-11-21 16:32:27,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 91 remaining)
[2022-11-21 16:32:27,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 91 remaining)
[2022-11-21 16:32:27,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 91 remaining)
[2022-11-21 16:32:27,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 91 remaining)
[2022-11-21 16:32:27,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 91 remaining)
[2022-11-21 16:32:27,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 91 remaining)
[2022-11-21 16:32:27,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 91 remaining)
[2022-11-21 16:32:27,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-11-21 16:32:27,475 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:27,483 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-11-21 16:32:27,483 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-21 16:32:27,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:32:27 BasicIcfg
[2022-11-21 16:32:27,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-21 16:32:27,633 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-21 16:32:27,633 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-21 16:32:27,634 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-21 16:32:27,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:31:33" (3/4) ...
[2022-11-21 16:32:27,637 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2022-11-21 16:32:27,637 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-21 16:32:27,639 INFO L158 Benchmark]: Toolchain (without parser) took 57059.80ms. Allocated memory was 148.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 121.4MB in the beginning and 536.1MB in the end (delta: -414.7MB). Peak memory consumption was 902.1MB. Max. memory is 16.1GB.
[2022-11-21 16:32:27,639 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 117.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-11-21 16:32:27,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.77ms. Allocated memory is still 148.9MB. Free memory was 121.4MB in the beginning and 96.0MB in the end (delta: 25.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2022-11-21 16:32:27,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.82ms. Allocated memory is still 148.9MB. Free memory was 96.0MB in the beginning and 93.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2022-11-21 16:32:27,640 INFO L158 Benchmark]: Boogie Preprocessor took 70.58ms. Allocated memory is still 148.9MB. Free memory was 93.3MB in the beginning and 90.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2022-11-21 16:32:27,641 INFO L158 Benchmark]: RCFGBuilder took 1883.28ms. Allocated memory is still 148.9MB. Free memory was 90.6MB in the beginning and 87.4MB in the end (delta: 3.2MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB.
[2022-11-21 16:32:27,641 INFO L158 Benchmark]: TraceAbstraction took 54324.00ms. Allocated memory was 148.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 87.4MB in the beginning and 536.1MB in the end (delta: -448.7MB). Peak memory consumption was 868.2MB. Max. memory is 16.1GB.
[2022-11-21 16:32:27,641 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 1.5GB. Free memory is still 536.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-11-21 16:32:27,647 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.22ms. Allocated memory is still 117.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 673.77ms. Allocated memory is still 148.9MB. Free memory was 121.4MB in the beginning and 96.0MB in the end (delta: 25.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 93.82ms. Allocated memory is still 148.9MB. Free memory was 96.0MB in the beginning and 93.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 70.58ms. Allocated memory is still 148.9MB. Free memory was 93.3MB in the beginning and 90.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 1883.28ms. Allocated memory is still 148.9MB. Free memory was 90.6MB in the beginning and 87.4MB in the end (delta: 3.2MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 54324.00ms. Allocated memory was 148.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 87.4MB in the beginning and 536.1MB in the end (delta: -448.7MB). Peak memory consumption was 868.2MB. Max. memory is 16.1GB.
* Witness Printer took 4.37ms. Allocated memory is still 1.5GB. Free memory is still 536.1MB. 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: 19.6s, 192 PlacesBefore, 88 PlacesAfterwards, 184 TransitionsBefore, 79 TransitionsAfterwards, 7512 CoEnabledTransitionPairs, 8 FixpointIterations, 69 TrivialSequentialCompositions, 89 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 163 TotalNumberOfCompositions, 30566 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12841, independent: 12328, independent conditional: 0, independent unconditional: 12328, dependent: 505, dependent conditional: 0, dependent unconditional: 505, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4500, independent: 4417, independent conditional: 0, independent unconditional: 4417, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4500, independent: 3912, independent conditional: 0, independent unconditional: 3912, dependent: 588, dependent conditional: 0, dependent unconditional: 588, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 588, independent: 505, independent conditional: 0, independent unconditional: 505, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2929, independent: 2118, independent conditional: 0, independent unconditional: 2118, dependent: 792, dependent conditional: 0, dependent unconditional: 792, unknown: 19, unknown conditional: 0, unknown unconditional: 19] ], Cache Queries: [ total: 12841, independent: 7911, independent conditional: 0, independent unconditional: 7911, dependent: 423, dependent conditional: 0, dependent unconditional: 423, unknown: 4507, unknown conditional: 0, unknown unconditional: 4507] , Statistics on independence cache: Total cache size (in pairs): 698, Positive cache size: 654, Positive conditional cache size: 0, Positive unconditional cache size: 654, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, 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;
[L861] 0 pthread_t t2449;
[L862] FCALL, FORK 0 pthread_create(&t2449, ((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(&t2449, ((void *)0), P0, ((void *)0))=-2, t2449={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]
[L863] 0 pthread_t t2450;
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, t2449={7:0}, t2450={8: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]
[L864] FCALL, FORK 0 pthread_create(&t2450, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2450, ((void *)0), P1, ((void *)0))=-1, t2449={7:0}, t2450={8: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]
[L791] 2 x$w_buff1 = x$w_buff0
[L792] 2 x$w_buff0 = 1
[L793] 2 x$w_buff1_used = x$w_buff0_used
[L794] 2 x$w_buff0_used = (_Bool)1
[L795] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19] COND FALSE 2 !(!expression)
[L795] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L796] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L797] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L798] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L799] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L800] 2 x$r_buff0_thd2 = (_Bool)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=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, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L865] 0 pthread_t t2451;
[L866] FCALL, FORK 0 pthread_create(&t2451, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2451, ((void *)0), P2, ((void *)0))=0, t2449={7:0}, t2450={8:0}, t2451={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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L817] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L818] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L819] 3 x$flush_delayed = weak$$choice2
[L820] EXPR 3 \read(x)
[L820] 3 x$mem_tmp = x
[L821] 3 weak$$choice1 = __VERIFIER_nondet_bool()
[L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))
[L822] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))
[L822] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)
[L822] EXPR 3 weak$$choice0 ? x$w_buff0 : x
[L822] EXPR 3 \read(x)
[L822] EXPR 3 weak$$choice0 ? x$w_buff0 : x
[L822] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)
[L822] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))
[L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))
[L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L822] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L823] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))))
[L824] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))))
[L825] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0))))
[L826] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L827] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L828] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L829] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1
[L830] 3 __unbuffered_p2_EAX$read_delayed_var = &x
[L831] EXPR 3 \read(x)
[L831] 3 __unbuffered_p2_EAX = x
[L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x
[L832] 3 x = x$flush_delayed ? x$mem_tmp : x
[L833] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L836] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, x$w_buff0_used=1, 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, x$w_buff0_used=1, 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] 1 x = x$flush_delayed ? x$mem_tmp : x
[L779] 1 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=1, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L803] 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)
[L803] 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)
[L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L805] 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
[L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=3, weak$$choice1=1, 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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L839] 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)
[L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L839] EXPR 3 \read(x)
[L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L839] 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)
[L839] 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)
[L840] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L841] 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
[L842] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L843] 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=1, 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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L846] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L848] 3 return 0;
[L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L786] 1 return 0;
[L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L812] 2 return 0;
[L868] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L870] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L870] RET 0 assume_abort_if_not(main$tmp_guard0)
[L872] 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)
[L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L872] EXPR 0 \read(x)
[L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L872] 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)
[L872] 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)
[L873] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L874] 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
[L875] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L876] 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}, __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}, main$tmp_guard0=1, main$tmp_guard1=0, t2449={7:0}, t2450={8:0}, t2451={5:0}, weak$$choice0=3, weak$$choice1=1, 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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L879] 0 weak$$choice1 = __VERIFIER_nondet_bool()
[L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L880] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var)
[L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L880] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L881] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L883] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
[L19] 0 reach_error()
VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, 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=1, 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=1, 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: 19]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -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: 859]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 866]: 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: 862]: 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: 864]: 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, 245 locations, 91 error locations. Started 1 CEGAR loops. OverallTime: 53.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 546 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 546 mSDsluCounter, 154 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2841 IncrementalHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 32 mSDtfsCounter, 2841 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54796occurred in iteration=0, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 2066 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 4085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2022-11-21 16:32:27,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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
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_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe028_power.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 0d78821bc3a287b999f98be361d707254bd2fa61b63b525cf42d392168336d80
--- 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 16:32:30,371 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-21 16:32:30,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-21 16:32:30,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-21 16:32:30,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-21 16:32:30,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-21 16:32:30,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-21 16:32:30,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-21 16:32:30,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-21 16:32:30,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-21 16:32:30,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-21 16:32:30,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-21 16:32:30,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-21 16:32:30,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-21 16:32:30,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-21 16:32:30,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-21 16:32:30,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-21 16:32:30,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-21 16:32:30,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-21 16:32:30,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-21 16:32:30,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-21 16:32:30,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-21 16:32:30,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-21 16:32:30,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-21 16:32:30,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-21 16:32:30,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-21 16:32:30,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-21 16:32:30,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-21 16:32:30,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-21 16:32:30,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-21 16:32:30,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-21 16:32:30,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-21 16:32:30,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-21 16:32:30,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-21 16:32:30,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-21 16:32:30,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-21 16:32:30,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-21 16:32:30,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-21 16:32:30,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-21 16:32:30,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-21 16:32:30,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-21 16:32:30,509 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2022-11-21 16:32:30,554 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-21 16:32:30,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-21 16:32:30,556 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-21 16:32:30,557 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-21 16:32:30,558 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-21 16:32:30,558 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-21 16:32:30,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-21 16:32:30,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-21 16:32:30,559 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-21 16:32:30,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-21 16:32:30,561 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-21 16:32:30,561 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2022-11-21 16:32:30,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-11-21 16:32:30,562 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-21 16:32:30,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-21 16:32:30,562 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2022-11-21 16:32:30,563 INFO L138 SettingsManager]: * Bitprecise bitfields=true
[2022-11-21 16:32:30,563 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2022-11-21 16:32:30,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-21 16:32:30,563 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2022-11-21 16:32:30,564 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true
[2022-11-21 16:32:30,564 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2022-11-21 16:32:30,564 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-21 16:32:30,564 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-21 16:32:30,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-21 16:32:30,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-21 16:32:30,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-21 16:32:30,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-21 16:32:30,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-21 16:32:30,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-21 16:32:30,566 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF
[2022-11-21 16:32:30,567 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2022-11-21 16:32:30,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2022-11-21 16:32:30,567 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_82f77afa-a5fb-4635-b904-0619dcb9fec3/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_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 -> 0d78821bc3a287b999f98be361d707254bd2fa61b63b525cf42d392168336d80
[2022-11-21 16:32:30,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-21 16:32:31,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-21 16:32:31,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-21 16:32:31,037 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-21 16:32:31,037 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-21 16:32:31,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe028_power.i
[2022-11-21 16:32:34,470 INFO L500 CDTParser]: Created temporary CDT project at NULL
[2022-11-21 16:32:34,747 INFO L351 CDTParser]: Found 1 translation units.
[2022-11-21 16:32:34,748 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/sv-benchmarks/c/pthread-wmm/safe028_power.i
[2022-11-21 16:32:34,765 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/data/bfb705a3b/91eba29fe91741a08ceb72f3218632a4/FLAG500bedb60
[2022-11-21 16:32:34,788 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/data/bfb705a3b/91eba29fe91741a08ceb72f3218632a4
[2022-11-21 16:32:34,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-21 16:32:34,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-21 16:32:34,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-21 16:32:34,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-21 16:32:34,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-21 16:32:34,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:32:34" (1/1) ...
[2022-11-21 16:32:34,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a978025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:34, skipping insertion in model container
[2022-11-21 16:32:34,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:32:34" (1/1) ...
[2022-11-21 16:32:34,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-21 16:32:34,898 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-21 16:32:35,078 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_82f77afa-a5fb-4635-b904-0619dcb9fec3/sv-benchmarks/c/pthread-wmm/safe028_power.i[990,1003]
[2022-11-21 16:32:35,341 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-21 16:32:35,364 INFO L203 MainTranslator]: Completed pre-run
[2022-11-21 16:32:35,383 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_82f77afa-a5fb-4635-b904-0619dcb9fec3/sv-benchmarks/c/pthread-wmm/safe028_power.i[990,1003]
[2022-11-21 16:32:35,477 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-21 16:32:35,530 INFO L208 MainTranslator]: Completed translation
[2022-11-21 16:32:35,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35 WrapperNode
[2022-11-21 16:32:35,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-21 16:32:35,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-21 16:32:35,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-21 16:32:35,532 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-21 16:32:35,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35" (1/1) ...
[2022-11-21 16:32:35,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35" (1/1) ...
[2022-11-21 16:32:35,583 INFO L138 Inliner]: procedures = 180, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 178
[2022-11-21 16:32:35,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-21 16:32:35,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-21 16:32:35,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-21 16:32:35,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-21 16:32:35,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35" (1/1) ...
[2022-11-21 16:32:35,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35" (1/1) ...
[2022-11-21 16:32:35,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35" (1/1) ...
[2022-11-21 16:32:35,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35" (1/1) ...
[2022-11-21 16:32:35,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35" (1/1) ...
[2022-11-21 16:32:35,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35" (1/1) ...
[2022-11-21 16:32:35,619 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35" (1/1) ...
[2022-11-21 16:32:35,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35" (1/1) ...
[2022-11-21 16:32:35,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-21 16:32:35,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-21 16:32:35,627 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-21 16:32:35,627 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-21 16:32:35,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35" (1/1) ...
[2022-11-21 16:32:35,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-21 16:32:35,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/z3
[2022-11-21 16:32:35,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-21 16:32:35,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-21 16:32:35,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2022-11-21 16:32:35,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-11-21 16:32:35,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-21 16:32:35,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-11-21 16:32:35,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-11-21 16:32:35,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2022-11-21 16:32:35,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2022-11-21 16:32:35,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4
[2022-11-21 16:32:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2022-11-21 16:32:35,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2022-11-21 16:32:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2022-11-21 16:32:35,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2022-11-21 16:32:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2022-11-21 16:32:35,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2022-11-21 16:32:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-11-21 16:32:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-21 16:32:35,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-21 16:32:35,757 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 16:32:35,999 INFO L235 CfgBuilder]: Building ICFG
[2022-11-21 16:32:36,002 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-21 16:32:36,806 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-21 16:32:37,580 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-21 16:32:37,580 INFO L300 CfgBuilder]: Removed 0 assume(true) statements.
[2022-11-21 16:32:37,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:32:37 BoogieIcfgContainer
[2022-11-21 16:32:37,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-21 16:32:37,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-21 16:32:37,585 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-21 16:32:37,588 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-21 16:32:37,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:32:34" (1/3) ...
[2022-11-21 16:32:37,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5db7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:32:37, skipping insertion in model container
[2022-11-21 16:32:37,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:32:35" (2/3) ...
[2022-11-21 16:32:37,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5db7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:32:37, skipping insertion in model container
[2022-11-21 16:32:37,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:32:37" (3/3) ...
[2022-11-21 16:32:37,594 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_power.i
[2022-11-21 16:32:37,615 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-21 16:32:37,615 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations.
[2022-11-21 16:32:37,615 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-11-21 16:32:37,857 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-11-21 16:32:37,903 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-11-21 16:32:37,922 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 185 transitions, 385 flow
[2022-11-21 16:32:37,925 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 185 transitions, 385 flow
[2022-11-21 16:32:37,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 185 transitions, 385 flow
[2022-11-21 16:32:38,058 INFO L130 PetriNetUnfolder]: 2/182 cut-off events.
[2022-11-21 16:32:38,058 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-11-21 16:32:38,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 182 events. 2/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 294 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place.
[2022-11-21 16:32:38,072 INFO L119 LiptonReduction]: Number of co-enabled transitions 7512
[2022-11-21 16:32:58,599 WARN L233 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 219 DAG size of output: 215 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2022-11-21 16:33:20,250 INFO L134 LiptonReduction]: Checked pairs total: 27580
[2022-11-21 16:33:20,250 INFO L136 LiptonReduction]: Total number of compositions: 162
[2022-11-21 16:33:20,259 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 79 transitions, 173 flow
[2022-11-21 16:33:22,320 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 0 states 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 16:33:22,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-21 16:33:22,402 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;@3a9ab87d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-21 16:33:22,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations.
[2022-11-21 16:33:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 0 states 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 16:33:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2
[2022-11-21 16:33:22,535 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:33:22,536 INFO L195 NwaCegarLoop]: trace histogram [1]
[2022-11-21 16:33:22,537 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:33:22,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1174, now seen corresponding path program 1 times
[2022-11-21 16:33:22,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:33:22,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407875545]
[2022-11-21 16:33:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:22,581 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 16:33:22,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:33:22,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:22,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:22,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core
[2022-11-21 16:33:22,919 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-21 16:33:22,924 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 16:33:22,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-21 16:33:22,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-21 16:33:22,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407875545]
[2022-11-21 16:33:22,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407875545] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:22,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:22,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2022-11-21 16:33:22,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402316021]
[2022-11-21 16:33:22,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:22,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-11-21 16:33:22,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-21 16:33:22,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-11-21 16:33:22,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-11-21 16:33:23,023 INFO L87 Difference]: Start difference. First operand has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 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 16:33:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:33:23,516 INFO L93 Difference]: Finished difference Result 9084 states and 32205 transitions.
[2022-11-21 16:33:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-11-21 16:33:23,518 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 16:33:23,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:33:23,627 INFO L225 Difference]: With dead ends: 9084
[2022-11-21 16:33:23,627 INFO L226 Difference]: Without dead ends: 9084
[2022-11-21 16:33:23,628 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 16:33:23,632 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-11-21 16:33:23,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-11-21 16:33:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states.
[2022-11-21 16:33:24,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 9084.
[2022-11-21 16:33:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9084 states, 7951 states have (on average 4.050433907684568) internal successors, (32205), 9083 states have internal predecessors, (32205), 0 states have call successors, (0), 0 states 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 16:33:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9084 states to 9084 states and 32205 transitions.
[2022-11-21 16:33:24,496 INFO L78 Accepts]: Start accepts. Automaton has 9084 states and 32205 transitions. Word has length 1
[2022-11-21 16:33:24,496 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:33:24,497 INFO L495 AbstractCegarLoop]: Abstraction has 9084 states and 32205 transitions.
[2022-11-21 16:33:24,497 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 16:33:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 9084 states and 32205 transitions.
[2022-11-21 16:33:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2022-11-21 16:33:24,498 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:33:24,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2022-11-21 16:33:24,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:24,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:24,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:33:24,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:24,709 INFO L85 PathProgramCache]: Analyzing trace with hash 35919569, now seen corresponding path program 1 times
[2022-11-21 16:33:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:33:24,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146018636]
[2022-11-21 16:33:24,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:24,710 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 16:33:24,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:33:24,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:24,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:24,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-11-21 16:33:24,975 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-21 16:33:25,083 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size
[2022-11-21 16:33:25,085 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 16:33:25,137 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 16:33:25,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-21 16:33:25,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-21 16:33:25,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146018636]
[2022-11-21 16:33:25,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146018636] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:25,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:25,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2022-11-21 16:33:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597375119]
[2022-11-21 16:33:25,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:25,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-21 16:33:25,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-21 16:33:25,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-21 16:33:25,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:33:25,146 INFO L87 Difference]: Start difference. First operand 9084 states and 32205 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 16:33:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:33:25,574 INFO L93 Difference]: Finished difference Result 5010 states and 17211 transitions.
[2022-11-21 16:33:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-21 16:33:25,575 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 16:33:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:33:25,615 INFO L225 Difference]: With dead ends: 5010
[2022-11-21 16:33:25,615 INFO L226 Difference]: Without dead ends: 5010
[2022-11-21 16:33:25,615 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 16:33:25,617 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-11-21 16:33:25,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-11-21 16:33:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5010 states.
[2022-11-21 16:33:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5010 to 5010.
[2022-11-21 16:33:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5010 states, 4599 states have (on average 3.742335290280496) internal successors, (17211), 5009 states have internal predecessors, (17211), 0 states have call successors, (0), 0 states 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 16:33:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5010 states to 5010 states and 17211 transitions.
[2022-11-21 16:33:25,924 INFO L78 Accepts]: Start accepts. Automaton has 5010 states and 17211 transitions. Word has length 4
[2022-11-21 16:33:25,924 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:33:25,924 INFO L495 AbstractCegarLoop]: Abstraction has 5010 states and 17211 transitions.
[2022-11-21 16:33:25,925 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 16:33:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5010 states and 17211 transitions.
[2022-11-21 16:33:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2022-11-21 16:33:25,926 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:33:25,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2022-11-21 16:33:25,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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)] Ended with exit code 0
[2022-11-21 16:33:26,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:26,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:33:26,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:26,138 INFO L85 PathProgramCache]: Analyzing trace with hash 35919570, now seen corresponding path program 1 times
[2022-11-21 16:33:26,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:33:26,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195532365]
[2022-11-21 16:33:26,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:26,139 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 16:33:26,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:33:26,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:26,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:26,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-11-21 16:33:26,436 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-21 16:33:26,472 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-11-21 16:33:26,474 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 16:33:26,524 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 16:33:26,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-21 16:33:26,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-21 16:33:26,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195532365]
[2022-11-21 16:33:26,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195532365] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:26,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:26,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2022-11-21 16:33:26,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030231962]
[2022-11-21 16:33:26,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:26,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-21 16:33:26,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-21 16:33:26,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-21 16:33:26,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:33:26,531 INFO L87 Difference]: Start difference. First operand 5010 states and 17211 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 16:33:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:33:26,724 INFO L93 Difference]: Finished difference Result 1886 states and 6165 transitions.
[2022-11-21 16:33:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-21 16:33:26,725 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 16:33:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:33:26,738 INFO L225 Difference]: With dead ends: 1886
[2022-11-21 16:33:26,739 INFO L226 Difference]: Without dead ends: 1886
[2022-11-21 16:33:26,739 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 16:33:26,740 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-11-21 16:33:26,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-11-21 16:33:26,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states.
[2022-11-21 16:33:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886.
[2022-11-21 16:33:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1817 states have (on average 3.3929554210236654) internal successors, (6165), 1885 states have internal predecessors, (6165), 0 states have call successors, (0), 0 states 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 16:33:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 6165 transitions.
[2022-11-21 16:33:26,823 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 6165 transitions. Word has length 4
[2022-11-21 16:33:26,823 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:33:26,823 INFO L495 AbstractCegarLoop]: Abstraction has 1886 states and 6165 transitions.
[2022-11-21 16:33:26,823 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 16:33:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 6165 transitions.
[2022-11-21 16:33:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2022-11-21 16:33:26,824 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:33:26,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:26,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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)] Ended with exit code 0
[2022-11-21 16:33:27,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:27,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:33:27,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 160037629, now seen corresponding path program 1 times
[2022-11-21 16:33:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:33:27,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967561091]
[2022-11-21 16:33:27,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:27,038 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 16:33:27,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:33:27,039 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:27,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:27,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-11-21 16:33:27,270 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-21 16:33:27,299 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 16:33:27,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-21 16:33:27,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-21 16:33:27,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967561091]
[2022-11-21 16:33:27,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967561091] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:27,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:27,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2022-11-21 16:33:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795091336]
[2022-11-21 16:33:27,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:27,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-21 16:33:27,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-21 16:33:27,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-21 16:33:27,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:33:27,304 INFO L87 Difference]: Start difference. First operand 1886 states and 6165 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states 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 16:33:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:33:27,592 INFO L93 Difference]: Finished difference Result 1574 states and 5087 transitions.
[2022-11-21 16:33:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-21 16:33:27,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6
[2022-11-21 16:33:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:33:27,611 INFO L225 Difference]: With dead ends: 1574
[2022-11-21 16:33:27,611 INFO L226 Difference]: Without dead ends: 1574
[2022-11-21 16:33:27,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 16:33:27,617 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-11-21 16:33:27,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-11-21 16:33:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states.
[2022-11-21 16:33:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574.
[2022-11-21 16:33:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1524 states have (on average 3.3379265091863517) internal successors, (5087), 1573 states have internal predecessors, (5087), 0 states have call successors, (0), 0 states 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 16:33:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 5087 transitions.
[2022-11-21 16:33:27,727 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 5087 transitions. Word has length 6
[2022-11-21 16:33:27,727 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:33:27,728 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 5087 transitions.
[2022-11-21 16:33:27,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states 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 16:33:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 5087 transitions.
[2022-11-21 16:33:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2022-11-21 16:33:27,729 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:33:27,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:27,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:27,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:27,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:33:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:27,943 INFO L85 PathProgramCache]: Analyzing trace with hash -198080603, now seen corresponding path program 1 times
[2022-11-21 16:33:27,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:33:27,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129294556]
[2022-11-21 16:33:27,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:27,944 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 16:33:27,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:33:27,945 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:27,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:28,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-11-21 16:33:28,171 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-21 16:33:28,212 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 16:33:28,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-21 16:33:28,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-21 16:33:28,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129294556]
[2022-11-21 16:33:28,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129294556] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:28,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:28,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-21 16:33:28,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069685746]
[2022-11-21 16:33:28,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:28,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-21 16:33:28,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-21 16:33:28,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-21 16:33:28,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:33:28,216 INFO L87 Difference]: Start difference. First operand 1574 states and 5087 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:33:28,457 INFO L93 Difference]: Finished difference Result 799 states and 2094 transitions.
[2022-11-21 16:33:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-21 16:33:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2022-11-21 16:33:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:33:28,462 INFO L225 Difference]: With dead ends: 799
[2022-11-21 16:33:28,462 INFO L226 Difference]: Without dead ends: 799
[2022-11-21 16:33:28,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:33:28,463 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-11-21 16:33:28,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-11-21 16:33:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states.
[2022-11-21 16:33:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799.
[2022-11-21 16:33:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 761 states have (on average 2.751642575558476) internal successors, (2094), 798 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states 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 16:33:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 2094 transitions.
[2022-11-21 16:33:28,488 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 2094 transitions. Word has length 10
[2022-11-21 16:33:28,488 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:33:28,489 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 2094 transitions.
[2022-11-21 16:33:28,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 2094 transitions.
[2022-11-21 16:33:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2022-11-21 16:33:28,490 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:33:28,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:28,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:28,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:28,704 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:33:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1304035184, now seen corresponding path program 1 times
[2022-11-21 16:33:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:33:28,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033388347]
[2022-11-21 16:33:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:28,705 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 16:33:28,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:33:28,706 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:28,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:28,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core
[2022-11-21 16:33:28,934 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-21 16:33:28,984 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 16:33:28,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-21 16:33:28,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-21 16:33:28,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033388347]
[2022-11-21 16:33:28,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033388347] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:28,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:28,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-21 16:33:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736857013]
[2022-11-21 16:33:28,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:28,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-21 16:33:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-21 16:33:28,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-21 16:33:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-21 16:33:28,987 INFO L87 Difference]: Start difference. First operand 799 states and 2094 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:33:29,288 INFO L93 Difference]: Finished difference Result 272 states and 569 transitions.
[2022-11-21 16:33:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-21 16:33:29,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2022-11-21 16:33:29,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:33:29,290 INFO L225 Difference]: With dead ends: 272
[2022-11-21 16:33:29,290 INFO L226 Difference]: Without dead ends: 272
[2022-11-21 16:33:29,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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 16:33:29,291 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-11-21 16:33:29,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-11-21 16:33:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states.
[2022-11-21 16:33:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272.
[2022-11-21 16:33:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 256 states have (on average 2.22265625) internal successors, (569), 271 states have internal predecessors, (569), 0 states have call successors, (0), 0 states 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 16:33:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 569 transitions.
[2022-11-21 16:33:29,299 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 569 transitions. Word has length 13
[2022-11-21 16:33:29,299 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:33:29,300 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 569 transitions.
[2022-11-21 16:33:29,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 569 transitions.
[2022-11-21 16:33:29,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2022-11-21 16:33:29,301 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:33:29,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:29,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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)] Forceful destruction successful, exit code 0
[2022-11-21 16:33:29,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:29,515 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:33:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash -624468604, now seen corresponding path program 1 times
[2022-11-21 16:33:29,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:33:29,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76432138]
[2022-11-21 16:33:29,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:29,517 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 16:33:29,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:33:29,518 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:29,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:29,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-11-21 16:33:29,762 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-21 16:33:29,831 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 16:33:29,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-21 16:33:29,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-21 16:33:29,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76432138]
[2022-11-21 16:33:29,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76432138] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:29,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:29,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-21 16:33:29,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432159858]
[2022-11-21 16:33:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:29,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-11-21 16:33:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-21 16:33:29,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-21 16:33:29,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-11-21 16:33:29,833 INFO L87 Difference]: Start difference. First operand 272 states and 569 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 16:33:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:33:30,260 INFO L93 Difference]: Finished difference Result 151 states and 336 transitions.
[2022-11-21 16:33:30,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-11-21 16:33:30,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 16:33:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:33:30,261 INFO L225 Difference]: With dead ends: 151
[2022-11-21 16:33:30,261 INFO L226 Difference]: Without dead ends: 151
[2022-11-21 16:33:30,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 16:33:30,262 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-11-21 16:33:30,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-11-21 16:33:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2022-11-21 16:33:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151.
[2022-11-21 16:33:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 2.2857142857142856) internal successors, (336), 150 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 336 transitions.
[2022-11-21 16:33:30,267 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 336 transitions. Word has length 16
[2022-11-21 16:33:30,267 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:33:30,268 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 336 transitions.
[2022-11-21 16:33:30,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 16:33:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 336 transitions.
[2022-11-21 16:33:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-11-21 16:33:30,269 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:33:30,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:30,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:30,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:30,482 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:33:30,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1341366580, now seen corresponding path program 1 times
[2022-11-21 16:33:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:33:30,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542327569]
[2022-11-21 16:33:30,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:30,483 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 16:33:30,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:33:30,485 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:30,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:30,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-11-21 16:33:30,777 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-21 16:33:41,621 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 16:33:41,990 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 16:33:42,424 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 16:33:42,459 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 16:33:42,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-21 16:33:42,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-21 16:33:42,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542327569]
[2022-11-21 16:33:42,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542327569] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:42,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:42,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-21 16:33:42,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177325408]
[2022-11-21 16:33:42,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:42,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-21 16:33:42,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-21 16:33:42,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-21 16:33:42,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2022-11-21 16:33:42,461 INFO L87 Difference]: Start difference. First operand 151 states and 336 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:33:42,745 INFO L93 Difference]: Finished difference Result 150 states and 335 transitions.
[2022-11-21 16:33:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-21 16:33:42,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20
[2022-11-21 16:33:42,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:33:42,746 INFO L225 Difference]: With dead ends: 150
[2022-11-21 16:33:42,746 INFO L226 Difference]: Without dead ends: 150
[2022-11-21 16:33:42,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2022-11-21 16:33:42,748 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-11-21 16:33:42,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-11-21 16:33:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2022-11-21 16:33:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150.
[2022-11-21 16:33:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 147 states have (on average 2.2789115646258504) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 335 transitions.
[2022-11-21 16:33:42,753 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 335 transitions. Word has length 20
[2022-11-21 16:33:42,753 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:33:42,754 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 335 transitions.
[2022-11-21 16:33:42,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 335 transitions.
[2022-11-21 16:33:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-11-21 16:33:42,755 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:33:42,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:42,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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)] Ended with exit code 0
[2022-11-21 16:33:42,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:42,970 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:33:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1341366579, now seen corresponding path program 1 times
[2022-11-21 16:33:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:33:42,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861426945]
[2022-11-21 16:33:42,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:42,971 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 16:33:42,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:33:42,972 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:42,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:43,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core
[2022-11-21 16:33:43,257 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-21 16:33:50,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 6 treesize of output 5
[2022-11-21 16:33:50,658 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 16:33:51,115 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 16:33:51,171 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 16:33:51,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-21 16:33:51,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-21 16:33:51,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861426945]
[2022-11-21 16:33:51,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861426945] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:51,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:51,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-21 16:33:51,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545382127]
[2022-11-21 16:33:51,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:51,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-21 16:33:51,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-21 16:33:51,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-21 16:33:51,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2022-11-21 16:33:51,173 INFO L87 Difference]: Start difference. First operand 150 states and 335 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:33:51,408 INFO L93 Difference]: Finished difference Result 149 states and 334 transitions.
[2022-11-21 16:33:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-11-21 16:33:51,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20
[2022-11-21 16:33:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:33:51,410 INFO L225 Difference]: With dead ends: 149
[2022-11-21 16:33:51,410 INFO L226 Difference]: Without dead ends: 149
[2022-11-21 16:33:51,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42
[2022-11-21 16:33:51,411 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-11-21 16:33:51,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-11-21 16:33:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2022-11-21 16:33:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149.
[2022-11-21 16:33:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 2.272108843537415) internal successors, (334), 148 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 334 transitions.
[2022-11-21 16:33:51,416 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 334 transitions. Word has length 20
[2022-11-21 16:33:51,416 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:33:51,416 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 334 transitions.
[2022-11-21 16:33:51,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 334 transitions.
[2022-11-21 16:33:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-11-21 16:33:51,417 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:33:51,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:51,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:51,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:51,618 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:33:51,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1367305228, now seen corresponding path program 1 times
[2022-11-21 16:33:51,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:33:51,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214571780]
[2022-11-21 16:33:51,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:51,619 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 16:33:51,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:33:51,620 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:51,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:51,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 34 conjunts are in the unsatisfiable core
[2022-11-21 16:33:51,920 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-21 16:33:55,282 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 16:33:55,498 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 16:33:55,859 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 52 treesize of output 36
[2022-11-21 16:33:56,048 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 16:33:56,335 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 16:33:56,430 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 16:33:56,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-21 16:33:56,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-21 16:33:56,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214571780]
[2022-11-21 16:33:56,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214571780] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:56,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:56,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-21 16:33:56,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230861225]
[2022-11-21 16:33:56,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:56,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-11-21 16:33:56,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-21 16:33:56,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-11-21 16:33:56,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2022-11-21 16:33:56,432 INFO L87 Difference]: Start difference. First operand 149 states and 334 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:33:57,482 INFO L93 Difference]: Finished difference Result 275 states and 582 transitions.
[2022-11-21 16:33:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-11-21 16:33:57,482 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21
[2022-11-21 16:33:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:33:57,483 INFO L225 Difference]: With dead ends: 275
[2022-11-21 16:33:57,484 INFO L226 Difference]: Without dead ends: 275
[2022-11-21 16:33:57,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2022-11-21 16:33:57,484 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 82 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-11-21 16:33:57,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 14 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-11-21 16:33:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states.
[2022-11-21 16:33:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 183.
[2022-11-21 16:33:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 2.2154696132596685) internal successors, (401), 182 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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 16:33:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 401 transitions.
[2022-11-21 16:33:57,492 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 401 transitions. Word has length 21
[2022-11-21 16:33:57,492 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:33:57,492 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 401 transitions.
[2022-11-21 16:33:57,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 401 transitions.
[2022-11-21 16:33:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-11-21 16:33:57,494 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:33:57,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:57,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:57,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:57,695 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:33:57,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:57,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1566724260, now seen corresponding path program 2 times
[2022-11-21 16:33:57,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:33:57,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788219]
[2022-11-21 16:33:57,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-11-21 16:33:57,696 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 16:33:57,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:33:57,697 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:57,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:57,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-11-21 16:33:57,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-11-21 16:33:57,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjunts are in the unsatisfiable core
[2022-11-21 16:33:57,966 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-21 16:33:58,006 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 16:33:58,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-21 16:33:58,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-21 16:33:58,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788219]
[2022-11-21 16:33:58,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788219] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:58,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:58,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-21 16:33:58,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668045473]
[2022-11-21 16:33:58,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:58,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-21 16:33:58,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-21 16:33:58,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-21 16:33:58,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-21 16:33:58,008 INFO L87 Difference]: Start difference. First operand 183 states and 401 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:33:58,271 INFO L93 Difference]: Finished difference Result 245 states and 518 transitions.
[2022-11-21 16:33:58,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-21 16:33:58,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21
[2022-11-21 16:33:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:33:58,272 INFO L225 Difference]: With dead ends: 245
[2022-11-21 16:33:58,272 INFO L226 Difference]: Without dead ends: 245
[2022-11-21 16:33:58,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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 16:33:58,273 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-11-21 16:33:58,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-11-21 16:33:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states.
[2022-11-21 16:33:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 195.
[2022-11-21 16:33:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 193 states have (on average 2.227979274611399) internal successors, (430), 194 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 430 transitions.
[2022-11-21 16:33:58,279 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 430 transitions. Word has length 21
[2022-11-21 16:33:58,280 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:33:58,280 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 430 transitions.
[2022-11-21 16:33:58,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 430 transitions.
[2022-11-21 16:33:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-11-21 16:33:58,281 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:33:58,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:58,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:58,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:58,495 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:33:58,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1973270156, now seen corresponding path program 3 times
[2022-11-21 16:33:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:33:58,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891746682]
[2022-11-21 16:33:58,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-11-21 16:33:58,496 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 16:33:58,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:33:58,497 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:58,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:33:58,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2022-11-21 16:33:58,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-11-21 16:33:58,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 36 conjunts are in the unsatisfiable core
[2022-11-21 16:33:58,799 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-21 16:34:22,985 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 16:34:23,091 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 16:34:23,819 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 156 treesize of output 144
[2022-11-21 16:34:24,746 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 98 treesize of output 78
[2022-11-21 16:34:25,177 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 89 treesize of output 77
[2022-11-21 16:34:25,680 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 16:34:25,968 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 16:34:25,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-21 16:34:25,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-21 16:34:25,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891746682]
[2022-11-21 16:34:25,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891746682] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:34:25,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:34:25,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-21 16:34:25,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618377999]
[2022-11-21 16:34:25,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:34:25,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-11-21 16:34:25,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-21 16:34:25,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-11-21 16:34:25,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2022-11-21 16:34:25,970 INFO L87 Difference]: Start difference. First operand 195 states and 430 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-21 16:34:27,447 INFO L93 Difference]: Finished difference Result 309 states and 651 transitions.
[2022-11-21 16:34:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-11-21 16:34:27,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21
[2022-11-21 16:34:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-21 16:34:27,449 INFO L225 Difference]: With dead ends: 309
[2022-11-21 16:34:27,450 INFO L226 Difference]: Without dead ends: 309
[2022-11-21 16:34:27,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2022-11-21 16:34:27,451 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-11-21 16:34:27,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 28 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-11-21 16:34:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states.
[2022-11-21 16:34:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 202.
[2022-11-21 16:34:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 2.245) internal successors, (449), 201 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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 16:34:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 449 transitions.
[2022-11-21 16:34:27,457 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 449 transitions. Word has length 21
[2022-11-21 16:34:27,458 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-21 16:34:27,458 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 449 transitions.
[2022-11-21 16:34:27,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 449 transitions.
[2022-11-21 16:34:27,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-11-21 16:34:27,459 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-21 16:34:27,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:34:27,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:34:27,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:34:27,673 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] ===
[2022-11-21 16:34:27,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:34:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash 333468044, now seen corresponding path program 4 times
[2022-11-21 16:34:27,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-21 16:34:27,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458118876]
[2022-11-21 16:34:27,674 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-11-21 16:34:27,674 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 16:34:27,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/bin/uautomizer-vX5HgA9Q3a/mathsat
[2022-11-21 16:34:27,675 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:34:27,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:34:28,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-11-21 16:34:28,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat
[2022-11-21 16:34:28,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-21 16:34:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-21 16:34:28,376 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2022-11-21 16:34:28,377 INFO L359 BasicCegarLoop]: Counterexample is feasible
[2022-11-21 16:34:28,378 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (90 of 91 remaining)
[2022-11-21 16:34:28,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 91 remaining)
[2022-11-21 16:34:28,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 91 remaining)
[2022-11-21 16:34:28,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 91 remaining)
[2022-11-21 16:34:28,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 91 remaining)
[2022-11-21 16:34:28,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 91 remaining)
[2022-11-21 16:34:28,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 91 remaining)
[2022-11-21 16:34:28,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 91 remaining)
[2022-11-21 16:34:28,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 91 remaining)
[2022-11-21 16:34:28,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 91 remaining)
[2022-11-21 16:34:28,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 91 remaining)
[2022-11-21 16:34:28,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 91 remaining)
[2022-11-21 16:34:28,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 91 remaining)
[2022-11-21 16:34:28,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (77 of 91 remaining)
[2022-11-21 16:34:28,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 91 remaining)
[2022-11-21 16:34:28,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 91 remaining)
[2022-11-21 16:34:28,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 91 remaining)
[2022-11-21 16:34:28,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 91 remaining)
[2022-11-21 16:34:28,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 91 remaining)
[2022-11-21 16:34:28,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 91 remaining)
[2022-11-21 16:34:28,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 91 remaining)
[2022-11-21 16:34:28,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 91 remaining)
[2022-11-21 16:34:28,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 91 remaining)
[2022-11-21 16:34:28,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 91 remaining)
[2022-11-21 16:34:28,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 91 remaining)
[2022-11-21 16:34:28,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 91 remaining)
[2022-11-21 16:34:28,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 91 remaining)
[2022-11-21 16:34:28,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 91 remaining)
[2022-11-21 16:34:28,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 91 remaining)
[2022-11-21 16:34:28,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 91 remaining)
[2022-11-21 16:34:28,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 91 remaining)
[2022-11-21 16:34:28,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 91 remaining)
[2022-11-21 16:34:28,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 91 remaining)
[2022-11-21 16:34:28,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 91 remaining)
[2022-11-21 16:34:28,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 91 remaining)
[2022-11-21 16:34:28,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 91 remaining)
[2022-11-21 16:34:28,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 91 remaining)
[2022-11-21 16:34:28,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 91 remaining)
[2022-11-21 16:34:28,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 91 remaining)
[2022-11-21 16:34:28,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 91 remaining)
[2022-11-21 16:34:28,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 91 remaining)
[2022-11-21 16:34:28,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 91 remaining)
[2022-11-21 16:34:28,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 91 remaining)
[2022-11-21 16:34:28,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 91 remaining)
[2022-11-21 16:34:28,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 91 remaining)
[2022-11-21 16:34:28,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 91 remaining)
[2022-11-21 16:34:28,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 91 remaining)
[2022-11-21 16:34:28,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 91 remaining)
[2022-11-21 16:34:28,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 91 remaining)
[2022-11-21 16:34:28,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 91 remaining)
[2022-11-21 16:34:28,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (40 of 91 remaining)
[2022-11-21 16:34:28,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 91 remaining)
[2022-11-21 16:34:28,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 91 remaining)
[2022-11-21 16:34:28,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 91 remaining)
[2022-11-21 16:34:28,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 91 remaining)
[2022-11-21 16:34:28,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 91 remaining)
[2022-11-21 16:34:28,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 91 remaining)
[2022-11-21 16:34:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 91 remaining)
[2022-11-21 16:34:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 91 remaining)
[2022-11-21 16:34:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 91 remaining)
[2022-11-21 16:34:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 91 remaining)
[2022-11-21 16:34:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 91 remaining)
[2022-11-21 16:34:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 91 remaining)
[2022-11-21 16:34:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 91 remaining)
[2022-11-21 16:34:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 91 remaining)
[2022-11-21 16:34:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 91 remaining)
[2022-11-21 16:34:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 91 remaining)
[2022-11-21 16:34:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 91 remaining)
[2022-11-21 16:34:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 91 remaining)
[2022-11-21 16:34:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 91 remaining)
[2022-11-21 16:34:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 91 remaining)
[2022-11-21 16:34:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 91 remaining)
[2022-11-21 16:34:28,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 91 remaining)
[2022-11-21 16:34:28,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 91 remaining)
[2022-11-21 16:34:28,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 91 remaining)
[2022-11-21 16:34:28,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 91 remaining)
[2022-11-21 16:34:28,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 91 remaining)
[2022-11-21 16:34:28,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 91 remaining)
[2022-11-21 16:34:28,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 91 remaining)
[2022-11-21 16:34:28,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 91 remaining)
[2022-11-21 16:34:28,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 91 remaining)
[2022-11-21 16:34:28,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 91 remaining)
[2022-11-21 16:34:28,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 91 remaining)
[2022-11-21 16:34:28,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 91 remaining)
[2022-11-21 16:34:28,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 91 remaining)
[2022-11-21 16:34:28,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 91 remaining)
[2022-11-21 16:34:28,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 91 remaining)
[2022-11-21 16:34:28,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 91 remaining)
[2022-11-21 16:34:28,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 91 remaining)
[2022-11-21 16:34:28,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 91 remaining)
[2022-11-21 16:34:28,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 91 remaining)
[2022-11-21 16:34:28,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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)] Forceful destruction successful, exit code 0
[2022-11-21 16:34:28,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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 16:34:28,619 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:34:28,625 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-11-21 16:34:28,625 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-21 16:34:28,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:34:28 BasicIcfg
[2022-11-21 16:34:28,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-21 16:34:28,795 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-21 16:34:28,795 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-21 16:34:28,796 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-21 16:34:28,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:32:37" (3/4) ...
[2022-11-21 16:34:28,799 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2022-11-21 16:34:28,800 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-21 16:34:28,801 INFO L158 Benchmark]: Toolchain (without parser) took 114008.21ms. Allocated memory was 71.3MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 44.2MB in the beginning and 626.5MB in the end (delta: -582.4MB). Peak memory consumption was 604.0MB. Max. memory is 16.1GB.
[2022-11-21 16:34:28,802 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 54.5MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2022-11-21 16:34:28,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.02ms. Allocated memory is still 71.3MB. Free memory was 44.0MB in the beginning and 36.0MB in the end (delta: 8.0MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB.
[2022-11-21 16:34:28,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.20ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 33.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2022-11-21 16:34:28,803 INFO L158 Benchmark]: Boogie Preprocessor took 41.75ms. Allocated memory is still 71.3MB. Free memory was 33.3MB in the beginning and 30.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2022-11-21 16:34:28,804 INFO L158 Benchmark]: RCFGBuilder took 1955.94ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 30.6MB in the beginning and 45.0MB in the end (delta: -14.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2022-11-21 16:34:28,804 INFO L158 Benchmark]: TraceAbstraction took 111209.73ms. Allocated memory was 104.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 44.4MB in the beginning and 626.5MB in the end (delta: -582.2MB). Peak memory consumption was 571.2MB. Max. memory is 16.1GB.
[2022-11-21 16:34:28,804 INFO L158 Benchmark]: Witness Printer took 5.63ms. Allocated memory is still 1.3GB. Free memory is still 626.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-11-21 16:34:28,806 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.35ms. Allocated memory is still 54.5MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 736.02ms. Allocated memory is still 71.3MB. Free memory was 44.0MB in the beginning and 36.0MB in the end (delta: 8.0MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 52.20ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 33.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 41.75ms. Allocated memory is still 71.3MB. Free memory was 33.3MB in the beginning and 30.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 1955.94ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 30.6MB in the beginning and 45.0MB in the end (delta: -14.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 111209.73ms. Allocated memory was 104.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 44.4MB in the beginning and 626.5MB in the end (delta: -582.2MB). Peak memory consumption was 571.2MB. Max. memory is 16.1GB.
* Witness Printer took 5.63ms. Allocated memory is still 1.3GB. Free memory is still 626.5MB. 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: 42.3s, 193 PlacesBefore, 88 PlacesAfterwards, 185 TransitionsBefore, 79 TransitionsAfterwards, 7512 CoEnabledTransitionPairs, 7 FixpointIterations, 66 TrivialSequentialCompositions, 90 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 162 TotalNumberOfCompositions, 27580 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11648, independent: 11200, independent conditional: 0, independent unconditional: 11200, dependent: 440, dependent conditional: 0, dependent unconditional: 440, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4585, independent: 4500, independent conditional: 0, independent unconditional: 4500, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4585, independent: 3964, independent conditional: 0, independent unconditional: 3964, dependent: 621, dependent conditional: 0, dependent unconditional: 621, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 621, independent: 536, independent conditional: 0, independent unconditional: 536, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7478, independent: 3894, independent conditional: 0, independent unconditional: 3894, dependent: 1536, dependent conditional: 0, dependent unconditional: 1536, unknown: 2048, unknown conditional: 0, unknown unconditional: 2048] ], Cache Queries: [ total: 11648, independent: 6700, independent conditional: 0, independent unconditional: 6700, dependent: 357, dependent conditional: 0, dependent unconditional: 357, unknown: 4591, unknown conditional: 0, unknown unconditional: 4591] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 673, Positive conditional cache size: 0, Positive unconditional cache size: 673, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, 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;
[L861] 0 pthread_t t2449;
[L862] FCALL, FORK 0 pthread_create(&t2449, ((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(&t2449, ((void *)0), P0, ((void *)0))=-2, t2449={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]
[L863] 0 pthread_t t2450;
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, t2449={7:0}, t2450={14: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]
[L864] FCALL, FORK 0 pthread_create(&t2450, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2450, ((void *)0), P1, ((void *)0))=-1, t2449={7:0}, t2450={14: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]
[L791] 2 x$w_buff1 = x$w_buff0
[L792] 2 x$w_buff0 = 1
[L793] 2 x$w_buff1_used = x$w_buff0_used
[L794] 2 x$w_buff0_used = (_Bool)1
[L795] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19] COND FALSE 2 !(!expression)
[L795] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L796] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L797] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L798] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L799] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L800] 2 x$r_buff0_thd2 = (_Bool)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=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, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L865] 0 pthread_t t2451;
[L866] FCALL, FORK 0 pthread_create(&t2451, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2451, ((void *)0), P2, ((void *)0))=0, t2449={7:0}, t2450={14:0}, t2451={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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L817] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L818] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L819] 3 x$flush_delayed = weak$$choice2
[L820] EXPR 3 \read(x)
[L820] 3 x$mem_tmp = x
[L821] 3 weak$$choice1 = __VERIFIER_nondet_bool()
[L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))
[L822] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))
[L822] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)
[L822] EXPR 3 weak$$choice0 ? x$w_buff0 : x
[L822] EXPR 3 \read(x)
[L822] EXPR 3 weak$$choice0 ? x$w_buff0 : x
[L822] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)
[L822] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))
[L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))
[L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L822] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L823] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))))
[L824] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))))
[L825] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0))))
[L826] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L827] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L828] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L829] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1
[L830] 3 __unbuffered_p2_EAX$read_delayed_var = &x
[L831] EXPR 3 \read(x)
[L831] 3 __unbuffered_p2_EAX = x
[L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x
[L832] 3 x = x$flush_delayed ? x$mem_tmp : x
[L833] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=128, weak$$choice2=2, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L836] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=128, weak$$choice2=2, 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=1, 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=1, x$w_buff0_used=1, 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=128, weak$$choice2=2, 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=1, 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=1, x$w_buff0_used=1, 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] 1 x = x$flush_delayed ? x$mem_tmp : x
[L779] 1 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=128, weak$$choice2=2, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L786] 1 return 0;
[L803] 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)
[L803] 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)
[L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L805] 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
[L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L807] 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}, __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=3, weak$$choice1=128, weak$$choice2=2, 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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L812] 2 return 0;
[L839] 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)
[L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L839] EXPR 3 \read(x)
[L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L839] 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)
[L839] 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)
[L840] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L841] 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
[L842] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L843] 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 [\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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=128, weak$$choice2=2, 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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L846] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L848] 3 return 0;
[L868] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L870] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L870] RET 0 assume_abort_if_not(main$tmp_guard0)
[L872] 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)
[L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L872] EXPR 0 \read(x)
[L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L872] 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)
[L872] 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)
[L873] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L874] 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
[L875] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L876] 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}, __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}, main$tmp_guard0=1, main$tmp_guard1=0, t2449={7:0}, t2450={14:0}, t2451={15:0}, weak$$choice0=3, weak$$choice1=128, weak$$choice2=2, 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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L879] 0 weak$$choice1 = __VERIFIER_nondet_bool()
[L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L880] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var)
[L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L880] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L881] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L883] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
[L19] 0 reach_error()
VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=128, weak$$choice2=2, 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=1, 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=1, 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: 19]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -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: 859]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 866]: 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: 864]: 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: 862]: 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, 246 locations, 91 error locations. Started 1 CEGAR loops. OverallTime: 110.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 44.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 337 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1302 IncrementalHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 22 mSDtfsCounter, 1302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54796occurred in iteration=0, InterpolantAutomatonStates: 51, 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, 12 MinimizatonAttempts, 249 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 51.9s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 2416 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1854 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 16:34:28,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f77afa-a5fb-4635-b904-0619dcb9fec3/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