/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:07:30,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:07:30,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:07:30,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:07:30,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:07:30,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:07:30,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:07:30,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:07:30,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:07:30,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:07:30,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:07:30,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:07:30,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:07:30,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:07:30,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:07:30,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:07:30,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:07:30,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:07:30,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:07:30,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:07:30,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:07:30,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:07:30,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:07:30,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:07:30,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:07:30,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:07:30,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:07:30,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:07:30,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:07:30,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:07:30,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:07:30,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:07:30,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:07:30,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:07:30,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:07:30,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:07:30,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:07:30,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:07:30,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:07:30,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:07:30,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:07:30,947 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:07:30,971 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:07:30,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:07:30,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:07:30,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:07:30,973 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:07:30,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:07:30,974 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:07:30,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:07:30,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:07:30,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:07:30,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:07:30,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:07:30,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:07:30,975 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:07:30,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:07:30,975 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:07:30,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:07:30,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:07:30,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:07:30,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:07:30,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:07:30,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:07:30,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:07:30,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:07:30,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:07:30,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:07:30,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:07:30,978 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:07:30,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:07:31,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:07:31,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:07:31,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:07:31,273 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:07:31,274 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:07:31,274 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_pso.opt.i [2020-10-16 12:07:31,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/689820cf1/c78bf240b23548718897556094ff41f1/FLAG26e2621f6 [2020-10-16 12:07:31,967 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:07:31,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe003_pso.opt.i [2020-10-16 12:07:31,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/689820cf1/c78bf240b23548718897556094ff41f1/FLAG26e2621f6 [2020-10-16 12:07:32,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/689820cf1/c78bf240b23548718897556094ff41f1 [2020-10-16 12:07:32,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:07:32,195 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:07:32,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:07:32,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:07:32,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:07:32,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:07:32" (1/1) ... [2020-10-16 12:07:32,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@482da65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:32, skipping insertion in model container [2020-10-16 12:07:32,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:07:32" (1/1) ... [2020-10-16 12:07:32,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:07:32,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:07:32,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:07:32,880 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:07:32,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:07:33,049 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:07:33,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:33 WrapperNode [2020-10-16 12:07:33,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:07:33,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:07:33,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:07:33,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:07:33,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:33" (1/1) ... [2020-10-16 12:07:33,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:33" (1/1) ... [2020-10-16 12:07:33,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:07:33,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:07:33,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:07:33,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:07:33,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:33" (1/1) ... [2020-10-16 12:07:33,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:33" (1/1) ... [2020-10-16 12:07:33,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:33" (1/1) ... [2020-10-16 12:07:33,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:33" (1/1) ... [2020-10-16 12:07:33,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:33" (1/1) ... [2020-10-16 12:07:33,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:33" (1/1) ... [2020-10-16 12:07:33,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:33" (1/1) ... [2020-10-16 12:07:33,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:07:33,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:07:33,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:07:33,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:07:33,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:33" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:07:33,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:07:33,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:07:33,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:07:33,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:07:33,291 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:07:33,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:07:33,291 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:07:33,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:07:33,292 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:07:33,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:07:33,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:07:33,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:07:33,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:07:33,295 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:07:37,240 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:07:37,240 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:07:37,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:07:37 BoogieIcfgContainer [2020-10-16 12:07:37,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:07:37,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:07:37,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:07:37,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:07:37,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:07:32" (1/3) ... [2020-10-16 12:07:37,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2626a642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:07:37, skipping insertion in model container [2020-10-16 12:07:37,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:33" (2/3) ... [2020-10-16 12:07:37,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2626a642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:07:37, skipping insertion in model container [2020-10-16 12:07:37,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:07:37" (3/3) ... [2020-10-16 12:07:37,252 INFO L111 eAbstractionObserver]: Analyzing ICFG safe003_pso.opt.i [2020-10-16 12:07:37,264 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:07:37,264 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:07:37,272 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:07:37,273 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:07:37,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,312 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,313 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,313 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,321 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,322 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,345 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,349 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,350 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,359 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,361 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:37,365 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:07:37,380 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:07:37,404 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:07:37,405 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:07:37,405 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:07:37,405 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:07:37,405 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:07:37,405 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:07:37,405 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:07:37,405 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:07:37,419 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:07:37,420 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-16 12:07:37,423 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-16 12:07:37,425 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 12:07:37,494 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 12:07:37,495 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:07:37,501 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 12:07:37,508 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-16 12:07:39,066 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 12:07:39,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 12:07:39,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:07:39,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 12:07:39,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:07:40,344 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-10-16 12:07:40,894 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:07:42,099 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 215 DAG size of output: 175 [2020-10-16 12:07:42,656 WARN L193 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2020-10-16 12:07:44,153 WARN L193 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-16 12:07:44,466 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 12:07:45,396 WARN L193 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-16 12:07:45,698 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 12:07:46,378 WARN L193 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2020-10-16 12:07:46,694 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-16 12:07:47,238 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 12:07:47,597 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 12:07:48,158 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-16 12:07:48,491 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 12:07:48,874 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 12:07:48,990 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 12:07:48,997 INFO L132 LiptonReduction]: Checked pairs total: 4431 [2020-10-16 12:07:48,997 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 12:07:49,004 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-16 12:07:49,067 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-10-16 12:07:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-10-16 12:07:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-16 12:07:49,075 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:49,076 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-16 12:07:49,077 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:49,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:49,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1687516, now seen corresponding path program 1 times [2020-10-16 12:07:49,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:49,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996407135] [2020-10-16 12:07:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:49,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996407135] [2020-10-16 12:07:49,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:49,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:49,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237904275] [2020-10-16 12:07:49,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:49,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:49,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:49,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:49,361 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-10-16 12:07:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:49,499 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-16 12:07:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:49,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-16 12:07:49,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:49,526 INFO L225 Difference]: With dead ends: 687 [2020-10-16 12:07:49,526 INFO L226 Difference]: Without dead ends: 562 [2020-10-16 12:07:49,528 INFO L677 BasicCegarLoop]: 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 [2020-10-16 12:07:49,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-16 12:07:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-16 12:07:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-16 12:07:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-16 12:07:49,626 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-10-16 12:07:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:49,627 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-16 12:07:49,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-16 12:07:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:07:49,629 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:49,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:49,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:07:49,630 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:49,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1641134889, now seen corresponding path program 1 times [2020-10-16 12:07:49,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:49,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708174027] [2020-10-16 12:07:49,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:49,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708174027] [2020-10-16 12:07:49,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:49,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:49,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388521212] [2020-10-16 12:07:49,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:49,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:49,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:49,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:49,832 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 4 states. [2020-10-16 12:07:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:49,902 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2020-10-16 12:07:49,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:49,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-16 12:07:49,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:49,908 INFO L225 Difference]: With dead ends: 552 [2020-10-16 12:07:49,909 INFO L226 Difference]: Without dead ends: 552 [2020-10-16 12:07:49,910 INFO L677 BasicCegarLoop]: 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 [2020-10-16 12:07:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-10-16 12:07:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2020-10-16 12:07:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-10-16 12:07:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2020-10-16 12:07:49,933 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2020-10-16 12:07:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:49,934 INFO L481 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2020-10-16 12:07:49,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2020-10-16 12:07:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:07:49,936 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:49,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:49,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:07:49,937 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:49,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:49,937 INFO L82 PathProgramCache]: Analyzing trace with hash -228279540, now seen corresponding path program 1 times [2020-10-16 12:07:49,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:49,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164348232] [2020-10-16 12:07:49,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:50,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164348232] [2020-10-16 12:07:50,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:50,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:50,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858649788] [2020-10-16 12:07:50,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:50,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:50,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:50,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:50,006 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand 3 states. [2020-10-16 12:07:50,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:50,024 INFO L93 Difference]: Finished difference Result 512 states and 1545 transitions. [2020-10-16 12:07:50,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:50,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:07:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:50,030 INFO L225 Difference]: With dead ends: 512 [2020-10-16 12:07:50,030 INFO L226 Difference]: Without dead ends: 512 [2020-10-16 12:07:50,030 INFO L677 BasicCegarLoop]: 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 [2020-10-16 12:07:50,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-10-16 12:07:50,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2020-10-16 12:07:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2020-10-16 12:07:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1545 transitions. [2020-10-16 12:07:50,046 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1545 transitions. Word has length 10 [2020-10-16 12:07:50,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:50,046 INFO L481 AbstractCegarLoop]: Abstraction has 512 states and 1545 transitions. [2020-10-16 12:07:50,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1545 transitions. [2020-10-16 12:07:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:07:50,049 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:50,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:50,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:07:50,050 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:50,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:50,050 INFO L82 PathProgramCache]: Analyzing trace with hash -911863458, now seen corresponding path program 1 times [2020-10-16 12:07:50,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:50,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600671561] [2020-10-16 12:07:50,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:50,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600671561] [2020-10-16 12:07:50,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:50,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:50,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007401077] [2020-10-16 12:07:50,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:50,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:50,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:50,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:50,165 INFO L87 Difference]: Start difference. First operand 512 states and 1545 transitions. Second operand 3 states. [2020-10-16 12:07:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:50,223 INFO L93 Difference]: Finished difference Result 497 states and 1493 transitions. [2020-10-16 12:07:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:50,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:07:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:50,228 INFO L225 Difference]: With dead ends: 497 [2020-10-16 12:07:50,229 INFO L226 Difference]: Without dead ends: 497 [2020-10-16 12:07:50,229 INFO L677 BasicCegarLoop]: 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 [2020-10-16 12:07:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-10-16 12:07:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2020-10-16 12:07:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-10-16 12:07:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1493 transitions. [2020-10-16 12:07:50,244 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1493 transitions. Word has length 11 [2020-10-16 12:07:50,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:50,245 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 1493 transitions. [2020-10-16 12:07:50,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:50,245 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1493 transitions. [2020-10-16 12:07:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:07:50,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:50,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:50,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:07:50,248 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:50,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:50,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1797004227, now seen corresponding path program 1 times [2020-10-16 12:07:50,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:50,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628385746] [2020-10-16 12:07:50,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:50,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628385746] [2020-10-16 12:07:50,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:50,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:50,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103000908] [2020-10-16 12:07:50,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:50,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:50,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:50,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:50,357 INFO L87 Difference]: Start difference. First operand 497 states and 1493 transitions. Second operand 4 states. [2020-10-16 12:07:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:50,391 INFO L93 Difference]: Finished difference Result 677 states and 1988 transitions. [2020-10-16 12:07:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:50,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:07:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:50,395 INFO L225 Difference]: With dead ends: 677 [2020-10-16 12:07:50,395 INFO L226 Difference]: Without dead ends: 337 [2020-10-16 12:07:50,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-10-16 12:07:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2020-10-16 12:07:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-10-16 12:07:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 947 transitions. [2020-10-16 12:07:50,405 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 947 transitions. Word has length 12 [2020-10-16 12:07:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:50,405 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 947 transitions. [2020-10-16 12:07:50,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 947 transitions. [2020-10-16 12:07:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:07:50,406 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:50,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:50,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:07:50,407 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:50,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:50,407 INFO L82 PathProgramCache]: Analyzing trace with hash -535010565, now seen corresponding path program 1 times [2020-10-16 12:07:50,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:50,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381350318] [2020-10-16 12:07:50,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:50,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381350318] [2020-10-16 12:07:50,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:50,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:50,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770829593] [2020-10-16 12:07:50,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:07:50,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:50,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:07:50,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:50,528 INFO L87 Difference]: Start difference. First operand 337 states and 947 transitions. Second operand 5 states. [2020-10-16 12:07:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:50,690 INFO L93 Difference]: Finished difference Result 544 states and 1532 transitions. [2020-10-16 12:07:50,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:07:50,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:07:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:50,694 INFO L225 Difference]: With dead ends: 544 [2020-10-16 12:07:50,694 INFO L226 Difference]: Without dead ends: 304 [2020-10-16 12:07:50,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:07:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-10-16 12:07:50,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-10-16 12:07:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-10-16 12:07:50,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 832 transitions. [2020-10-16 12:07:50,704 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 832 transitions. Word has length 14 [2020-10-16 12:07:50,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:50,705 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 832 transitions. [2020-10-16 12:07:50,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:07:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 832 transitions. [2020-10-16 12:07:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:07:50,706 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:50,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:50,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:07:50,706 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:50,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:50,707 INFO L82 PathProgramCache]: Analyzing trace with hash 526855995, now seen corresponding path program 2 times [2020-10-16 12:07:50,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:50,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726847669] [2020-10-16 12:07:50,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:50,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726847669] [2020-10-16 12:07:50,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:50,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:50,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828963226] [2020-10-16 12:07:50,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:07:50,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:50,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:07:50,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:50,861 INFO L87 Difference]: Start difference. First operand 304 states and 832 transitions. Second operand 5 states. [2020-10-16 12:07:51,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:51,020 INFO L93 Difference]: Finished difference Result 369 states and 1010 transitions. [2020-10-16 12:07:51,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:07:51,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:07:51,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:51,024 INFO L225 Difference]: With dead ends: 369 [2020-10-16 12:07:51,024 INFO L226 Difference]: Without dead ends: 369 [2020-10-16 12:07:51,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:07:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2020-10-16 12:07:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 344. [2020-10-16 12:07:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-10-16 12:07:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 941 transitions. [2020-10-16 12:07:51,045 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 941 transitions. Word has length 14 [2020-10-16 12:07:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:51,046 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 941 transitions. [2020-10-16 12:07:51,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:07:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 941 transitions. [2020-10-16 12:07:51,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:07:51,049 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:51,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:51,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:07:51,049 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:51,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:51,050 INFO L82 PathProgramCache]: Analyzing trace with hash -847358933, now seen corresponding path program 1 times [2020-10-16 12:07:51,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:51,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504458296] [2020-10-16 12:07:51,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:51,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504458296] [2020-10-16 12:07:51,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:51,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:07:51,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717808436] [2020-10-16 12:07:51,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:07:51,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:07:51,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:51,323 INFO L87 Difference]: Start difference. First operand 344 states and 941 transitions. Second operand 6 states. [2020-10-16 12:07:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:51,490 INFO L93 Difference]: Finished difference Result 407 states and 1093 transitions. [2020-10-16 12:07:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:07:51,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:07:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:51,503 INFO L225 Difference]: With dead ends: 407 [2020-10-16 12:07:51,503 INFO L226 Difference]: Without dead ends: 339 [2020-10-16 12:07:51,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:07:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-10-16 12:07:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 325. [2020-10-16 12:07:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2020-10-16 12:07:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 860 transitions. [2020-10-16 12:07:51,520 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 860 transitions. Word has length 15 [2020-10-16 12:07:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:51,520 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 860 transitions. [2020-10-16 12:07:51,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:07:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 860 transitions. [2020-10-16 12:07:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:07:51,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:51,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:51,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:07:51,522 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:51,522 INFO L82 PathProgramCache]: Analyzing trace with hash -847372387, now seen corresponding path program 1 times [2020-10-16 12:07:51,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:51,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270757259] [2020-10-16 12:07:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:51,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270757259] [2020-10-16 12:07:51,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:51,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:07:51,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866901079] [2020-10-16 12:07:51,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:07:51,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:51,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:07:51,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:51,752 INFO L87 Difference]: Start difference. First operand 325 states and 860 transitions. Second operand 6 states. [2020-10-16 12:07:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:51,909 INFO L93 Difference]: Finished difference Result 387 states and 1005 transitions. [2020-10-16 12:07:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:07:51,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:07:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:51,913 INFO L225 Difference]: With dead ends: 387 [2020-10-16 12:07:51,913 INFO L226 Difference]: Without dead ends: 251 [2020-10-16 12:07:51,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:07:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-10-16 12:07:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2020-10-16 12:07:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-10-16 12:07:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 643 transitions. [2020-10-16 12:07:51,921 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 643 transitions. Word has length 15 [2020-10-16 12:07:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:51,922 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 643 transitions. [2020-10-16 12:07:51,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:07:51,922 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 643 transitions. [2020-10-16 12:07:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:07:51,923 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:51,923 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:51,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:07:51,923 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash -472730713, now seen corresponding path program 1 times [2020-10-16 12:07:51,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:51,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485542355] [2020-10-16 12:07:51,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:52,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485542355] [2020-10-16 12:07:52,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:52,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:07:52,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336412542] [2020-10-16 12:07:52,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:07:52,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:52,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:07:52,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:07:52,314 INFO L87 Difference]: Start difference. First operand 251 states and 643 transitions. Second operand 9 states. [2020-10-16 12:07:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:52,738 INFO L93 Difference]: Finished difference Result 349 states and 871 transitions. [2020-10-16 12:07:52,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 12:07:52,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-16 12:07:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:52,745 INFO L225 Difference]: With dead ends: 349 [2020-10-16 12:07:52,745 INFO L226 Difference]: Without dead ends: 246 [2020-10-16 12:07:52,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:07:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-10-16 12:07:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 233. [2020-10-16 12:07:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-10-16 12:07:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 592 transitions. [2020-10-16 12:07:52,753 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 592 transitions. Word has length 16 [2020-10-16 12:07:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:52,754 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 592 transitions. [2020-10-16 12:07:52,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:07:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 592 transitions. [2020-10-16 12:07:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:07:52,755 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:52,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:52,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:07:52,756 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash -818604223, now seen corresponding path program 2 times [2020-10-16 12:07:52,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:52,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955696081] [2020-10-16 12:07:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:52,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955696081] [2020-10-16 12:07:52,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:52,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:52,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338873646] [2020-10-16 12:07:52,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:52,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:52,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:52,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:52,880 INFO L87 Difference]: Start difference. First operand 233 states and 592 transitions. Second operand 4 states. [2020-10-16 12:07:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:52,917 INFO L93 Difference]: Finished difference Result 236 states and 534 transitions. [2020-10-16 12:07:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:07:52,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 12:07:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:52,919 INFO L225 Difference]: With dead ends: 236 [2020-10-16 12:07:52,919 INFO L226 Difference]: Without dead ends: 179 [2020-10-16 12:07:52,920 INFO L677 BasicCegarLoop]: 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 [2020-10-16 12:07:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-16 12:07:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2020-10-16 12:07:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-10-16 12:07:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 400 transitions. [2020-10-16 12:07:52,925 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 400 transitions. Word has length 16 [2020-10-16 12:07:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:52,926 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 400 transitions. [2020-10-16 12:07:52,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 400 transitions. [2020-10-16 12:07:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:07:52,927 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:52,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:52,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:07:52,927 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:52,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:52,928 INFO L82 PathProgramCache]: Analyzing trace with hash 587266755, now seen corresponding path program 1 times [2020-10-16 12:07:52,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:52,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112846983] [2020-10-16 12:07:52,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:53,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112846983] [2020-10-16 12:07:53,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:53,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:07:53,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163601685] [2020-10-16 12:07:53,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:07:53,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:07:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:53,041 INFO L87 Difference]: Start difference. First operand 179 states and 400 transitions. Second operand 5 states. [2020-10-16 12:07:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:53,098 INFO L93 Difference]: Finished difference Result 153 states and 309 transitions. [2020-10-16 12:07:53,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:07:53,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 12:07:53,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:53,100 INFO L225 Difference]: With dead ends: 153 [2020-10-16 12:07:53,100 INFO L226 Difference]: Without dead ends: 120 [2020-10-16 12:07:53,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-16 12:07:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-10-16 12:07:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-16 12:07:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 235 transitions. [2020-10-16 12:07:53,105 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 235 transitions. Word has length 17 [2020-10-16 12:07:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:53,106 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 235 transitions. [2020-10-16 12:07:53,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:07:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 235 transitions. [2020-10-16 12:07:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:07:53,107 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:53,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:53,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:07:53,108 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:53,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1243642172, now seen corresponding path program 1 times [2020-10-16 12:07:53,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:53,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441591883] [2020-10-16 12:07:53,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:53,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441591883] [2020-10-16 12:07:53,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:53,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:07:53,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766932823] [2020-10-16 12:07:53,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:07:53,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:53,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:07:53,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:07:53,340 INFO L87 Difference]: Start difference. First operand 120 states and 235 transitions. Second operand 8 states. [2020-10-16 12:07:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:53,581 INFO L93 Difference]: Finished difference Result 138 states and 267 transitions. [2020-10-16 12:07:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:07:53,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-10-16 12:07:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:53,586 INFO L225 Difference]: With dead ends: 138 [2020-10-16 12:07:53,586 INFO L226 Difference]: Without dead ends: 138 [2020-10-16 12:07:53,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:07:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-10-16 12:07:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-10-16 12:07:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-16 12:07:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 264 transitions. [2020-10-16 12:07:53,591 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 264 transitions. Word has length 19 [2020-10-16 12:07:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:53,591 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 264 transitions. [2020-10-16 12:07:53,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:07:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 264 transitions. [2020-10-16 12:07:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:07:53,592 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:53,592 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:53,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:07:53,593 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:53,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:53,593 INFO L82 PathProgramCache]: Analyzing trace with hash -950095154, now seen corresponding path program 2 times [2020-10-16 12:07:53,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:53,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093880209] [2020-10-16 12:07:53,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:53,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093880209] [2020-10-16 12:07:53,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:53,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:07:53,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555001339] [2020-10-16 12:07:53,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:07:53,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:53,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:07:53,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:53,803 INFO L87 Difference]: Start difference. First operand 136 states and 264 transitions. Second operand 6 states. [2020-10-16 12:07:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:53,951 INFO L93 Difference]: Finished difference Result 142 states and 276 transitions. [2020-10-16 12:07:53,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:07:53,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 12:07:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:53,953 INFO L225 Difference]: With dead ends: 142 [2020-10-16 12:07:53,954 INFO L226 Difference]: Without dead ends: 142 [2020-10-16 12:07:53,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:07:53,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-16 12:07:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 126. [2020-10-16 12:07:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-10-16 12:07:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 247 transitions. [2020-10-16 12:07:53,959 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 247 transitions. Word has length 19 [2020-10-16 12:07:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:53,960 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 247 transitions. [2020-10-16 12:07:53,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:07:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 247 transitions. [2020-10-16 12:07:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:07:53,961 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:53,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:53,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:07:53,961 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:53,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:53,962 INFO L82 PathProgramCache]: Analyzing trace with hash -757077068, now seen corresponding path program 1 times [2020-10-16 12:07:53,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:53,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747958721] [2020-10-16 12:07:53,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:54,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747958721] [2020-10-16 12:07:54,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:54,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:07:54,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870108668] [2020-10-16 12:07:54,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:07:54,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:54,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:07:54,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:54,077 INFO L87 Difference]: Start difference. First operand 126 states and 247 transitions. Second operand 6 states. [2020-10-16 12:07:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:54,135 INFO L93 Difference]: Finished difference Result 112 states and 217 transitions. [2020-10-16 12:07:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:07:54,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 12:07:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:54,137 INFO L225 Difference]: With dead ends: 112 [2020-10-16 12:07:54,138 INFO L226 Difference]: Without dead ends: 102 [2020-10-16 12:07:54,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:07:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-16 12:07:54,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2020-10-16 12:07:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-16 12:07:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 165 transitions. [2020-10-16 12:07:54,141 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 165 transitions. Word has length 19 [2020-10-16 12:07:54,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:54,141 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 165 transitions. [2020-10-16 12:07:54,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:07:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 165 transitions. [2020-10-16 12:07:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:07:54,142 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:54,142 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:54,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:07:54,143 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:54,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1015673999, now seen corresponding path program 1 times [2020-10-16 12:07:54,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:54,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907619674] [2020-10-16 12:07:54,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:54,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907619674] [2020-10-16 12:07:54,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:54,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:07:54,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47174899] [2020-10-16 12:07:54,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:07:54,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:54,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:07:54,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:07:54,363 INFO L87 Difference]: Start difference. First operand 86 states and 165 transitions. Second operand 8 states. [2020-10-16 12:07:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:54,526 INFO L93 Difference]: Finished difference Result 112 states and 213 transitions. [2020-10-16 12:07:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:07:54,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-16 12:07:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:54,527 INFO L225 Difference]: With dead ends: 112 [2020-10-16 12:07:54,527 INFO L226 Difference]: Without dead ends: 68 [2020-10-16 12:07:54,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:07:54,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-16 12:07:54,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2020-10-16 12:07:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-16 12:07:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-10-16 12:07:54,530 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 21 [2020-10-16 12:07:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:54,531 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-10-16 12:07:54,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:07:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-10-16 12:07:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:07:54,531 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:54,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:54,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:07:54,532 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:54,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:54,532 INFO L82 PathProgramCache]: Analyzing trace with hash 695420251, now seen corresponding path program 2 times [2020-10-16 12:07:54,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:54,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261632362] [2020-10-16 12:07:54,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:07:54,591 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:07:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:07:54,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:07:54,698 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:07:54,699 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:07:54,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:07:54,700 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:07:54,722 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1651] [1651] L3-->L851: Formula: (let ((.cse6 (= (mod ~y$r_buff0_thd0~0_In46853955 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In46853955 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In46853955 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In46853955 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (or (and (= ~y$w_buff1_used~0_Out46853955 ~y$w_buff1_used~0_In46853955) .cse0) (and .cse1 .cse2 (= ~y$w_buff1_used~0_Out46853955 0))) (or (and .cse3 .cse4 (= ~y~0_Out46853955 ~y$w_buff0~0_In46853955)) (and (or (and .cse1 .cse2 (= ~y~0_Out46853955 ~y$w_buff1~0_In46853955)) (and (= ~y~0_Out46853955 ~y~0_In46853955) .cse0)) .cse5)) (or (and .cse3 .cse4 (= ~y$w_buff0_used~0_Out46853955 0)) (and (= ~y$w_buff0_used~0_In46853955 ~y$w_buff0_used~0_Out46853955) .cse5)) (= ~y$r_buff0_thd0~0_In46853955 ~y$r_buff0_thd0~0_Out46853955) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In46853955 0)) (= ~y$r_buff1_thd0~0_In46853955 ~y$r_buff1_thd0~0_Out46853955)))) InVars {ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In46853955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In46853955, ~y$w_buff1~0=~y$w_buff1~0_In46853955, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In46853955, ~y$w_buff0~0=~y$w_buff0~0_In46853955, ~y~0=~y~0_In46853955, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In46853955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In46853955} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out46853955, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out46853955|, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out46853955|, ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out46853955|, ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out46853955|, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out46853955|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In46853955, ~y$w_buff1~0=~y$w_buff1~0_In46853955, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out46853955|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out46853955, ~y$w_buff0~0=~y$w_buff0~0_In46853955, ~y~0=~y~0_Out46853955, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out46853955, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out46853955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite72, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite70, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite69, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 12:07:54,728 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,736 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,736 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,739 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,741 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,742 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,742 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,745 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,750 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,751 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,751 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,751 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,752 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,752 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,753 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,753 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,755 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,755 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,756 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,756 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,756 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,757 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,757 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,758 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,758 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,759 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,759 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,759 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,760 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,760 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,761 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,761 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,761 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,762 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,762 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,768 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,769 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,769 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:54,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:54,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:07:54 BasicIcfg [2020-10-16 12:07:54,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:07:54,876 INFO L168 Benchmark]: Toolchain (without parser) took 22682.17 ms. Allocated memory was 139.5 MB in the beginning and 453.0 MB in the end (delta: 313.5 MB). Free memory was 101.3 MB in the beginning and 88.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 326.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:54,877 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:07:54,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 854.52 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 154.2 MB in the end (delta: -53.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:54,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.95 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 150.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:54,879 INFO L168 Benchmark]: Boogie Preprocessor took 78.96 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 147.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:54,879 INFO L168 Benchmark]: RCFGBuilder took 4035.78 ms. Allocated memory was 203.4 MB in the beginning and 296.7 MB in the end (delta: 93.3 MB). Free memory was 147.5 MB in the beginning and 257.0 MB in the end (delta: -109.5 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:54,880 INFO L168 Benchmark]: TraceAbstraction took 17630.13 ms. Allocated memory was 296.7 MB in the beginning and 453.0 MB in the end (delta: 156.2 MB). Free memory was 257.0 MB in the beginning and 88.7 MB in the end (delta: 168.3 MB). Peak memory consumption was 324.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:54,884 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 854.52 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 154.2 MB in the end (delta: -53.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.95 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 150.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.96 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 147.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4035.78 ms. Allocated memory was 203.4 MB in the beginning and 296.7 MB in the end (delta: 93.3 MB). Free memory was 147.5 MB in the beginning and 257.0 MB in the end (delta: -109.5 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17630.13 ms. Allocated memory was 296.7 MB in the beginning and 453.0 MB in the end (delta: 156.2 MB). Free memory was 257.0 MB in the beginning and 88.7 MB in the end (delta: 168.3 MB). Peak memory consumption was 324.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 873 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 74 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.5s, 101 PlacesBefore, 36 PlacesAfterwards, 93 TransitionsBefore, 26 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4431 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L705] 0 _Bool main$tmp_guard0; [L706] 0 _Bool main$tmp_guard1; [L708] 0 int x = 0; [L710] 0 int y = 0; [L711] 0 _Bool y$flush_delayed; [L712] 0 int y$mem_tmp; [L713] 0 _Bool y$r_buff0_thd0; [L714] 0 _Bool y$r_buff0_thd1; [L715] 0 _Bool y$r_buff0_thd2; [L716] 0 _Bool y$r_buff0_thd3; [L717] 0 _Bool y$r_buff1_thd0; [L718] 0 _Bool y$r_buff1_thd1; [L719] 0 _Bool y$r_buff1_thd2; [L720] 0 _Bool y$r_buff1_thd3; [L721] 0 _Bool y$read_delayed; [L722] 0 int *y$read_delayed_var; [L723] 0 int y$w_buff0; [L724] 0 _Bool y$w_buff0_used; [L725] 0 int y$w_buff1; [L726] 0 _Bool y$w_buff1_used; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1858; [L836] FCALL, FORK 0 pthread_create(&t1858, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$w_buff1 = y$w_buff0 [L733] 1 y$w_buff0 = 2 [L734] 1 y$w_buff1_used = y$w_buff0_used [L735] 1 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 1 !(!expression) [L737] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L738] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L739] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L740] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L741] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 pthread_t t1859; [L838] FCALL, FORK 0 pthread_create(&t1859, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L839] 0 pthread_t t1860; [L840] FCALL, FORK 0 pthread_create(&t1860, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 y$flush_delayed = weak$$choice2 [L784] 3 y$mem_tmp = y [L785] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L785] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L786] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L786] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L786] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L786] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L787] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L787] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L788] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L788] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L788] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L788] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L789] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L789] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L790] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L791] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L791] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = y [L793] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L793] 3 y = y$flush_delayed ? y$mem_tmp : y [L794] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __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=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 3 y$flush_delayed = weak$$choice2 [L800] 3 y$mem_tmp = y [L801] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L801] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L802] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L802] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L802] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L802] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L803] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L803] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L803] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L803] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L804] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L804] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L804] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L804] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L805] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L805] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L805] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L806] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L807] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L807] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L807] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 __unbuffered_p2_EBX = y [L809] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L809] 3 y = y$flush_delayed ? y$mem_tmp : y [L810] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] 0 y$mem_tmp = y [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L859] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L859] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L861] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L862] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L865] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L865] 0 y = y$flush_delayed ? y$mem_tmp : y [L866] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.2s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.6s, HoareTripleCheckerStatistics: 307 SDtfs, 489 SDslu, 550 SDs, 0 SdLazy, 477 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 92 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 36738 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 proved your program to be incorrect! Received shutdown request...