/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/mix044_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:03:14,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:03:14,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:03:14,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:03:14,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:03:14,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:03:14,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:03:14,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:03:14,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:03:14,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:03:14,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:03:14,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:03:14,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:03:14,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:03:14,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:03:14,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:03:14,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:03:14,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:03:14,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:03:14,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:03:14,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:03:14,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:03:14,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:03:14,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:03:14,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:03:14,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:03:14,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:03:14,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:03:14,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:03:14,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:03:14,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:03:14,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:03:14,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:03:14,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:03:14,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:03:14,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:03:14,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:03:14,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:03:14,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:03:14,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:03:14,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:03:14,329 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:03:14,358 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:03:14,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:03:14,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:03:14,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:03:14,360 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:03:14,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:03:14,360 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:03:14,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:03:14,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:03:14,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:03:14,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:03:14,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:03:14,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:03:14,362 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:03:14,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:03:14,362 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:03:14,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:03:14,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:03:14,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:03:14,363 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:03:14,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:03:14,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:03:14,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:03:14,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:03:14,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:03:14,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:03:14,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:03:14,365 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:03:14,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:03:14,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:03:14,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:03:14,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:03:14,697 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:03:14,697 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:03:14,698 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2020-10-16 12:03:14,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3edee20cd/bc1b683fb5f547ee90127f575ab26549/FLAGc90cea5e6 [2020-10-16 12:03:15,288 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:03:15,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2020-10-16 12:03:15,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3edee20cd/bc1b683fb5f547ee90127f575ab26549/FLAGc90cea5e6 [2020-10-16 12:03:15,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3edee20cd/bc1b683fb5f547ee90127f575ab26549 [2020-10-16 12:03:15,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:03:15,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:03:15,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:03:15,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:03:15,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:03:15,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:03:15" (1/1) ... [2020-10-16 12:03:15,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bf07c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:15, skipping insertion in model container [2020-10-16 12:03:15,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:03:15" (1/1) ... [2020-10-16 12:03:15,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:03:15,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:03:16,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:03:16,177 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:03:16,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:03:16,348 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:03:16,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:16 WrapperNode [2020-10-16 12:03:16,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:03:16,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:03:16,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:03:16,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:03:16,358 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:03:16" (1/1) ... [2020-10-16 12:03:16,380 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:03:16" (1/1) ... [2020-10-16 12:03:16,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:03:16,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:03:16,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:03:16,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:03:16,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:16" (1/1) ... [2020-10-16 12:03:16,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:16" (1/1) ... [2020-10-16 12:03:16,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:16" (1/1) ... [2020-10-16 12:03:16,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:16" (1/1) ... [2020-10-16 12:03:16,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:16" (1/1) ... [2020-10-16 12:03:16,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:16" (1/1) ... [2020-10-16 12:03:16,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:16" (1/1) ... [2020-10-16 12:03:16,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:03:16,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:03:16,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:03:16,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:03:16,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:16" (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:03:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:03:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:03:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:03:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:03:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:03:16,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:03:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:03:16,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:03:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:03:16,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:03:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:03:16,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:03:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:03:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:03:16,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:03:16,524 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:03:18,582 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:03:18,582 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:03:18,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:03:18 BoogieIcfgContainer [2020-10-16 12:03:18,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:03:18,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:03:18,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:03:18,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:03:18,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:03:15" (1/3) ... [2020-10-16 12:03:18,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241eac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:03:18, skipping insertion in model container [2020-10-16 12:03:18,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:16" (2/3) ... [2020-10-16 12:03:18,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241eac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:03:18, skipping insertion in model container [2020-10-16 12:03:18,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:03:18" (3/3) ... [2020-10-16 12:03:18,593 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2020-10-16 12:03:18,605 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:03:18,605 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:03:18,613 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:03:18,614 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:03:18,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,648 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,649 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,652 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,653 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,653 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,653 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,657 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,657 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,660 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,660 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,660 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,660 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,660 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,668 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,668 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,672 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,672 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,672 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,682 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,684 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,684 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,684 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,684 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:18,686 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:03:18,700 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:03:18,720 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:03:18,721 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:03:18,721 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:03:18,721 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:03:18,721 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:03:18,721 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:03:18,722 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:03:18,722 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:03:18,735 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:03:18,736 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 114 transitions, 248 flow [2020-10-16 12:03:18,739 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 114 transitions, 248 flow [2020-10-16 12:03:18,742 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 248 flow [2020-10-16 12:03:18,794 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2020-10-16 12:03:18,795 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:03:18,800 INFO L80 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 12:03:18,804 INFO L117 LiptonReduction]: Number of co-enabled transitions 2806 [2020-10-16 12:03:19,319 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 12:03:20,497 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 12:03:20,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 12:03:20,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:03:20,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 12:03:20,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:03:21,407 WARN L193 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-16 12:03:21,932 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:03:22,962 WARN L193 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2020-10-16 12:03:23,260 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-16 12:03:23,958 WARN L193 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2020-10-16 12:03:24,244 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-16 12:03:24,627 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 12:03:25,016 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 12:03:27,204 WARN L193 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 147 DAG size of output: 137 [2020-10-16 12:03:27,681 WARN L193 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 12:03:27,978 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-16 12:03:28,104 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 12:03:28,115 INFO L132 LiptonReduction]: Checked pairs total: 8039 [2020-10-16 12:03:28,116 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 12:03:28,125 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-10-16 12:03:28,434 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4872 states. [2020-10-16 12:03:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states. [2020-10-16 12:03:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 12:03:28,444 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:28,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 12:03:28,445 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:28,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:28,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1155557590, now seen corresponding path program 1 times [2020-10-16 12:03:28,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:28,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702148544] [2020-10-16 12:03:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:28,734 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:03:28,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702148544] [2020-10-16 12:03:28,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:28,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:03:28,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720067604] [2020-10-16 12:03:28,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:03:28,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:28,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:03:28,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:28,760 INFO L87 Difference]: Start difference. First operand 4872 states. Second operand 3 states. [2020-10-16 12:03:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:28,934 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-10-16 12:03:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:28,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 12:03:28,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:28,988 INFO L225 Difference]: With dead ends: 4062 [2020-10-16 12:03:28,988 INFO L226 Difference]: Without dead ends: 3312 [2020-10-16 12:03:28,989 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:03:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-10-16 12:03:29,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-10-16 12:03:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-10-16 12:03:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-10-16 12:03:29,184 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 5 [2020-10-16 12:03:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:29,185 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-10-16 12:03:29,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:03:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-10-16 12:03:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:03:29,188 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:29,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:29,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:03:29,189 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:29,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:29,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1763939588, now seen corresponding path program 1 times [2020-10-16 12:03:29,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:29,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17889570] [2020-10-16 12:03:29,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:29,314 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:03:29,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17889570] [2020-10-16 12:03:29,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:29,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:03:29,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922391880] [2020-10-16 12:03:29,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:03:29,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:29,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:03:29,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:29,318 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-10-16 12:03:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:29,368 INFO L93 Difference]: Finished difference Result 3262 states and 12720 transitions. [2020-10-16 12:03:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:29,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:03:29,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:29,399 INFO L225 Difference]: With dead ends: 3262 [2020-10-16 12:03:29,400 INFO L226 Difference]: Without dead ends: 3262 [2020-10-16 12:03:29,401 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:03:29,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2020-10-16 12:03:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2020-10-16 12:03:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-10-16 12:03:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 12720 transitions. [2020-10-16 12:03:29,615 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 12720 transitions. Word has length 11 [2020-10-16 12:03:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:29,617 INFO L481 AbstractCegarLoop]: Abstraction has 3262 states and 12720 transitions. [2020-10-16 12:03:29,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:03:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 12720 transitions. [2020-10-16 12:03:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:03:29,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:29,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:29,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:03:29,621 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:29,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:29,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1153002038, now seen corresponding path program 1 times [2020-10-16 12:03:29,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:29,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781510413] [2020-10-16 12:03:29,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:29,685 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:03:29,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781510413] [2020-10-16 12:03:29,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:29,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:03:29,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595102292] [2020-10-16 12:03:29,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:03:29,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:29,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:03:29,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:29,687 INFO L87 Difference]: Start difference. First operand 3262 states and 12720 transitions. Second operand 3 states. [2020-10-16 12:03:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:29,739 INFO L93 Difference]: Finished difference Result 3062 states and 11850 transitions. [2020-10-16 12:03:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:29,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 12:03:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:29,767 INFO L225 Difference]: With dead ends: 3062 [2020-10-16 12:03:29,767 INFO L226 Difference]: Without dead ends: 3062 [2020-10-16 12:03:29,768 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:03:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2020-10-16 12:03:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3062. [2020-10-16 12:03:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2020-10-16 12:03:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 11850 transitions. [2020-10-16 12:03:29,915 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 11850 transitions. Word has length 12 [2020-10-16 12:03:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:29,915 INFO L481 AbstractCegarLoop]: Abstraction has 3062 states and 11850 transitions. [2020-10-16 12:03:29,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:03:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 11850 transitions. [2020-10-16 12:03:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:03:29,924 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:29,924 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:29,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:03:29,925 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:29,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:29,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1383401611, now seen corresponding path program 1 times [2020-10-16 12:03:29,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:29,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658743419] [2020-10-16 12:03:29,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:30,058 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:03:30,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658743419] [2020-10-16 12:03:30,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:30,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:03:30,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534075216] [2020-10-16 12:03:30,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:03:30,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:30,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:03:30,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:30,063 INFO L87 Difference]: Start difference. First operand 3062 states and 11850 transitions. Second operand 3 states. [2020-10-16 12:03:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:30,126 INFO L93 Difference]: Finished difference Result 3022 states and 11668 transitions. [2020-10-16 12:03:30,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:30,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:03:30,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:30,170 INFO L225 Difference]: With dead ends: 3022 [2020-10-16 12:03:30,170 INFO L226 Difference]: Without dead ends: 3022 [2020-10-16 12:03:30,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-10-16 12:03:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2020-10-16 12:03:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2020-10-16 12:03:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 11668 transitions. [2020-10-16 12:03:30,272 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 11668 transitions. Word has length 13 [2020-10-16 12:03:30,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:30,273 INFO L481 AbstractCegarLoop]: Abstraction has 3022 states and 11668 transitions. [2020-10-16 12:03:30,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:03:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 11668 transitions. [2020-10-16 12:03:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:03:30,276 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:30,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:30,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:03:30,276 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:30,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1766410959, now seen corresponding path program 1 times [2020-10-16 12:03:30,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:30,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383214086] [2020-10-16 12:03:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:30,425 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:03:30,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383214086] [2020-10-16 12:03:30,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:30,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:03:30,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86579439] [2020-10-16 12:03:30,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:03:30,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:30,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:03:30,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:03:30,429 INFO L87 Difference]: Start difference. First operand 3022 states and 11668 transitions. Second operand 4 states. [2020-10-16 12:03:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:30,521 INFO L93 Difference]: Finished difference Result 3230 states and 12480 transitions. [2020-10-16 12:03:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:03:30,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 12:03:30,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:30,536 INFO L225 Difference]: With dead ends: 3230 [2020-10-16 12:03:30,537 INFO L226 Difference]: Without dead ends: 3230 [2020-10-16 12:03:30,537 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:03:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2020-10-16 12:03:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3230. [2020-10-16 12:03:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2020-10-16 12:03:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 12480 transitions. [2020-10-16 12:03:30,640 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 12480 transitions. Word has length 14 [2020-10-16 12:03:30,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:30,641 INFO L481 AbstractCegarLoop]: Abstraction has 3230 states and 12480 transitions. [2020-10-16 12:03:30,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:03:30,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 12480 transitions. [2020-10-16 12:03:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:03:30,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:30,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:30,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:03:30,645 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:30,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:30,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1999651903, now seen corresponding path program 1 times [2020-10-16 12:03:30,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:30,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014630352] [2020-10-16 12:03:30,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:30,817 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:03:30,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014630352] [2020-10-16 12:03:30,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:30,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:03:30,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599800128] [2020-10-16 12:03:30,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:03:30,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:30,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:03:30,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:30,820 INFO L87 Difference]: Start difference. First operand 3230 states and 12480 transitions. Second operand 5 states. [2020-10-16 12:03:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:30,933 INFO L93 Difference]: Finished difference Result 3170 states and 12227 transitions. [2020-10-16 12:03:30,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:03:30,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:03:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:30,951 INFO L225 Difference]: With dead ends: 3170 [2020-10-16 12:03:30,951 INFO L226 Difference]: Without dead ends: 3170 [2020-10-16 12:03:30,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:30,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2020-10-16 12:03:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3170. [2020-10-16 12:03:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2020-10-16 12:03:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 12227 transitions. [2020-10-16 12:03:31,059 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 12227 transitions. Word has length 15 [2020-10-16 12:03:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:31,059 INFO L481 AbstractCegarLoop]: Abstraction has 3170 states and 12227 transitions. [2020-10-16 12:03:31,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:03:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 12227 transitions. [2020-10-16 12:03:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:03:31,064 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:31,064 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:03:31,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:03:31,064 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:31,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:31,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1444077906, now seen corresponding path program 1 times [2020-10-16 12:03:31,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:31,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795434256] [2020-10-16 12:03:31,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:31,148 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:03:31,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795434256] [2020-10-16 12:03:31,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:31,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:03:31,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48212559] [2020-10-16 12:03:31,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:03:31,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:31,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:03:31,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:03:31,150 INFO L87 Difference]: Start difference. First operand 3170 states and 12227 transitions. Second operand 4 states. [2020-10-16 12:03:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:31,213 INFO L93 Difference]: Finished difference Result 3168 states and 11128 transitions. [2020-10-16 12:03:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:03:31,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 12:03:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:31,222 INFO L225 Difference]: With dead ends: 3168 [2020-10-16 12:03:31,223 INFO L226 Difference]: Without dead ends: 2346 [2020-10-16 12:03:31,223 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:03:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2020-10-16 12:03:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2346. [2020-10-16 12:03:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2346 states. [2020-10-16 12:03:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 8107 transitions. [2020-10-16 12:03:31,289 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 8107 transitions. Word has length 16 [2020-10-16 12:03:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:31,289 INFO L481 AbstractCegarLoop]: Abstraction has 2346 states and 8107 transitions. [2020-10-16 12:03:31,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:03:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 8107 transitions. [2020-10-16 12:03:31,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:03:31,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:31,293 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:03:31,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:03:31,293 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:31,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:31,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1380191672, now seen corresponding path program 1 times [2020-10-16 12:03:31,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:31,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25170588] [2020-10-16 12:03:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:31,408 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:03:31,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25170588] [2020-10-16 12:03:31,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:31,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:03:31,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792492955] [2020-10-16 12:03:31,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:03:31,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:31,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:03:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:31,411 INFO L87 Difference]: Start difference. First operand 2346 states and 8107 transitions. Second operand 5 states. [2020-10-16 12:03:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:31,480 INFO L93 Difference]: Finished difference Result 1968 states and 6316 transitions. [2020-10-16 12:03:31,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:03:31,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 12:03:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:31,490 INFO L225 Difference]: With dead ends: 1968 [2020-10-16 12:03:31,491 INFO L226 Difference]: Without dead ends: 1498 [2020-10-16 12:03:31,494 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:03:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2020-10-16 12:03:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1426. [2020-10-16 12:03:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1426 states. [2020-10-16 12:03:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 4463 transitions. [2020-10-16 12:03:31,539 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 4463 transitions. Word has length 17 [2020-10-16 12:03:31,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:31,540 INFO L481 AbstractCegarLoop]: Abstraction has 1426 states and 4463 transitions. [2020-10-16 12:03:31,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:03:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 4463 transitions. [2020-10-16 12:03:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:03:31,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:31,544 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] [2020-10-16 12:03:31,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:03:31,544 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:31,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:31,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1478602498, now seen corresponding path program 1 times [2020-10-16 12:03:31,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:31,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13492224] [2020-10-16 12:03:31,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:31,700 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:03:31,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13492224] [2020-10-16 12:03:31,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:31,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:03:31,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16378677] [2020-10-16 12:03:31,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:03:31,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:31,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:03:31,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:03:31,702 INFO L87 Difference]: Start difference. First operand 1426 states and 4463 transitions. Second operand 6 states. [2020-10-16 12:03:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:31,769 INFO L93 Difference]: Finished difference Result 1259 states and 3925 transitions. [2020-10-16 12:03:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:03:31,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-16 12:03:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:31,774 INFO L225 Difference]: With dead ends: 1259 [2020-10-16 12:03:31,775 INFO L226 Difference]: Without dead ends: 1129 [2020-10-16 12:03:31,775 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:03:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2020-10-16 12:03:31,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1113. [2020-10-16 12:03:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2020-10-16 12:03:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 3524 transitions. [2020-10-16 12:03:31,801 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 3524 transitions. Word has length 20 [2020-10-16 12:03:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:31,801 INFO L481 AbstractCegarLoop]: Abstraction has 1113 states and 3524 transitions. [2020-10-16 12:03:31,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:03:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 3524 transitions. [2020-10-16 12:03:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:03:31,805 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:31,805 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, 1, 1, 1] [2020-10-16 12:03:31,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:03:31,805 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:31,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:31,806 INFO L82 PathProgramCache]: Analyzing trace with hash -137945616, now seen corresponding path program 1 times [2020-10-16 12:03:31,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:31,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210544678] [2020-10-16 12:03:31,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:31,867 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:03:31,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210544678] [2020-10-16 12:03:31,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:31,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:03:31,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566494615] [2020-10-16 12:03:31,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:03:31,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:31,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:03:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:03:31,870 INFO L87 Difference]: Start difference. First operand 1113 states and 3524 transitions. Second operand 4 states. [2020-10-16 12:03:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:31,892 INFO L93 Difference]: Finished difference Result 1444 states and 4485 transitions. [2020-10-16 12:03:31,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:03:31,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-16 12:03:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:31,898 INFO L225 Difference]: With dead ends: 1444 [2020-10-16 12:03:31,898 INFO L226 Difference]: Without dead ends: 1116 [2020-10-16 12:03:31,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2020-10-16 12:03:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1113. [2020-10-16 12:03:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2020-10-16 12:03:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 3422 transitions. [2020-10-16 12:03:31,924 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 3422 transitions. Word has length 24 [2020-10-16 12:03:31,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:31,925 INFO L481 AbstractCegarLoop]: Abstraction has 1113 states and 3422 transitions. [2020-10-16 12:03:31,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:03:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 3422 transitions. [2020-10-16 12:03:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:03:31,928 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:31,928 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, 1, 1, 1] [2020-10-16 12:03:31,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:03:31,929 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:31,929 INFO L82 PathProgramCache]: Analyzing trace with hash -638021648, now seen corresponding path program 2 times [2020-10-16 12:03:31,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:31,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743134870] [2020-10-16 12:03:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:32,167 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:03:32,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743134870] [2020-10-16 12:03:32,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:32,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:03:32,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882634419] [2020-10-16 12:03:32,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:03:32,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:32,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:03:32,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:03:32,170 INFO L87 Difference]: Start difference. First operand 1113 states and 3422 transitions. Second operand 7 states. [2020-10-16 12:03:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:32,469 INFO L93 Difference]: Finished difference Result 1685 states and 5068 transitions. [2020-10-16 12:03:32,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:03:32,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-16 12:03:32,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:32,477 INFO L225 Difference]: With dead ends: 1685 [2020-10-16 12:03:32,478 INFO L226 Difference]: Without dead ends: 1562 [2020-10-16 12:03:32,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:03:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2020-10-16 12:03:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1177. [2020-10-16 12:03:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2020-10-16 12:03:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 3532 transitions. [2020-10-16 12:03:32,512 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 3532 transitions. Word has length 24 [2020-10-16 12:03:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:32,512 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 3532 transitions. [2020-10-16 12:03:32,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:03:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 3532 transitions. [2020-10-16 12:03:32,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:03:32,516 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:32,516 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, 1, 1, 1] [2020-10-16 12:03:32,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:03:32,516 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:32,517 INFO L82 PathProgramCache]: Analyzing trace with hash 619252764, now seen corresponding path program 1 times [2020-10-16 12:03:32,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:32,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785795559] [2020-10-16 12:03:32,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:32,566 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:03:32,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785795559] [2020-10-16 12:03:32,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:32,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:03:32,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341416455] [2020-10-16 12:03:32,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:03:32,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:32,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:03:32,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:32,568 INFO L87 Difference]: Start difference. First operand 1177 states and 3532 transitions. Second operand 3 states. [2020-10-16 12:03:32,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:32,585 INFO L93 Difference]: Finished difference Result 1633 states and 4778 transitions. [2020-10-16 12:03:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:32,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-16 12:03:32,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:32,589 INFO L225 Difference]: With dead ends: 1633 [2020-10-16 12:03:32,589 INFO L226 Difference]: Without dead ends: 1056 [2020-10-16 12:03:32,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2020-10-16 12:03:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1053. [2020-10-16 12:03:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2020-10-16 12:03:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 3013 transitions. [2020-10-16 12:03:32,615 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 3013 transitions. Word has length 24 [2020-10-16 12:03:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:32,615 INFO L481 AbstractCegarLoop]: Abstraction has 1053 states and 3013 transitions. [2020-10-16 12:03:32,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:03:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 3013 transitions. [2020-10-16 12:03:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:03:32,619 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:32,619 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, 1, 1, 1] [2020-10-16 12:03:32,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:03:32,620 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:32,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1848287020, now seen corresponding path program 3 times [2020-10-16 12:03:32,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:32,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992306158] [2020-10-16 12:03:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:32,882 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:03:32,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992306158] [2020-10-16 12:03:32,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:32,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:03:32,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151438012] [2020-10-16 12:03:32,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:03:32,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:32,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:03:32,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:03:32,884 INFO L87 Difference]: Start difference. First operand 1053 states and 3013 transitions. Second operand 8 states. [2020-10-16 12:03:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:33,096 INFO L93 Difference]: Finished difference Result 1460 states and 4154 transitions. [2020-10-16 12:03:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:03:33,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-16 12:03:33,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:33,102 INFO L225 Difference]: With dead ends: 1460 [2020-10-16 12:03:33,102 INFO L226 Difference]: Without dead ends: 1354 [2020-10-16 12:03:33,103 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:03:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-10-16 12:03:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1041. [2020-10-16 12:03:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2020-10-16 12:03:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 2986 transitions. [2020-10-16 12:03:33,132 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 2986 transitions. Word has length 24 [2020-10-16 12:03:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:33,132 INFO L481 AbstractCegarLoop]: Abstraction has 1041 states and 2986 transitions. [2020-10-16 12:03:33,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:03:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 2986 transitions. [2020-10-16 12:03:33,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:03:33,135 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:33,135 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, 1, 1, 1] [2020-10-16 12:03:33,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:03:33,136 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:33,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:33,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1955172994, now seen corresponding path program 2 times [2020-10-16 12:03:33,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:33,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451727901] [2020-10-16 12:03:33,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:33,236 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:03:33,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451727901] [2020-10-16 12:03:33,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:33,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:03:33,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332438346] [2020-10-16 12:03:33,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:03:33,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:33,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:03:33,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:03:33,238 INFO L87 Difference]: Start difference. First operand 1041 states and 2986 transitions. Second operand 7 states. [2020-10-16 12:03:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:33,309 INFO L93 Difference]: Finished difference Result 1008 states and 2921 transitions. [2020-10-16 12:03:33,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:03:33,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-16 12:03:33,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:33,311 INFO L225 Difference]: With dead ends: 1008 [2020-10-16 12:03:33,311 INFO L226 Difference]: Without dead ends: 357 [2020-10-16 12:03:33,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:03:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-10-16 12:03:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 303. [2020-10-16 12:03:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-10-16 12:03:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 796 transitions. [2020-10-16 12:03:33,319 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 796 transitions. Word has length 24 [2020-10-16 12:03:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:33,320 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 796 transitions. [2020-10-16 12:03:33,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:03:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 796 transitions. [2020-10-16 12:03:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 12:03:33,321 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:33,321 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:33,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:03:33,321 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash 276709806, now seen corresponding path program 1 times [2020-10-16 12:03:33,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:33,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870309753] [2020-10-16 12:03:33,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:33,635 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:03:33,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870309753] [2020-10-16 12:03:33,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:33,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:03:33,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597067117] [2020-10-16 12:03:33,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:03:33,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:33,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:03:33,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:03:33,638 INFO L87 Difference]: Start difference. First operand 303 states and 796 transitions. Second operand 8 states. [2020-10-16 12:03:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:33,860 INFO L93 Difference]: Finished difference Result 443 states and 1181 transitions. [2020-10-16 12:03:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:03:33,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-10-16 12:03:33,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:33,862 INFO L225 Difference]: With dead ends: 443 [2020-10-16 12:03:33,862 INFO L226 Difference]: Without dead ends: 397 [2020-10-16 12:03:33,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:03:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-10-16 12:03:33,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 295. [2020-10-16 12:03:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-10-16 12:03:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 772 transitions. [2020-10-16 12:03:33,870 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 772 transitions. Word has length 28 [2020-10-16 12:03:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:33,871 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 772 transitions. [2020-10-16 12:03:33,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:03:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 772 transitions. [2020-10-16 12:03:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 12:03:33,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:33,872 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:33,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:03:33,872 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:33,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:33,873 INFO L82 PathProgramCache]: Analyzing trace with hash 373801144, now seen corresponding path program 2 times [2020-10-16 12:03:33,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:33,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211893504] [2020-10-16 12:03:33,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:34,164 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2020-10-16 12:03:34,287 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:03:34,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211893504] [2020-10-16 12:03:34,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:34,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:03:34,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703612650] [2020-10-16 12:03:34,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:03:34,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:34,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:03:34,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:03:34,289 INFO L87 Difference]: Start difference. First operand 295 states and 772 transitions. Second operand 9 states. [2020-10-16 12:03:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:34,527 INFO L93 Difference]: Finished difference Result 375 states and 987 transitions. [2020-10-16 12:03:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:03:34,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-10-16 12:03:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:34,528 INFO L225 Difference]: With dead ends: 375 [2020-10-16 12:03:34,529 INFO L226 Difference]: Without dead ends: 289 [2020-10-16 12:03:34,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:03:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-10-16 12:03:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 265. [2020-10-16 12:03:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-10-16 12:03:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 704 transitions. [2020-10-16 12:03:34,535 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 704 transitions. Word has length 28 [2020-10-16 12:03:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:34,536 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 704 transitions. [2020-10-16 12:03:34,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:03:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 704 transitions. [2020-10-16 12:03:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 12:03:34,537 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:34,537 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:34,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:03:34,537 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1709902802, now seen corresponding path program 3 times [2020-10-16 12:03:34,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:34,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656268634] [2020-10-16 12:03:34,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:03:34,605 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:03:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:03:34,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:03:34,720 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:03:34,721 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:03:34,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:03:34,723 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:03:34,742 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1160] [1160] L2-->L863: Formula: (let ((.cse7 (= (mod ~x$w_buff1_used~0_In573096659 256) 0)) (.cse6 (= (mod ~x$r_buff1_thd0~0_In573096659 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In573096659 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In573096659 256) 0))) (let ((.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse3 (or .cse8 .cse9)) (.cse0 (not .cse6)) (.cse1 (not .cse7)) (.cse2 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out573096659 0)) (or (and (= ~x$w_buff1_used~0_Out573096659 0) .cse0 .cse1) (and .cse2 (= ~x$w_buff1_used~0_Out573096659 ~x$w_buff1_used~0_In573096659))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In573096659| ULTIMATE.start_assume_abort_if_not_~cond_Out573096659) (or (and .cse3 (= ~x$w_buff0_used~0_In573096659 ~x$w_buff0_used~0_Out573096659)) (and (= 0 ~x$w_buff0_used~0_Out573096659) .cse4 .cse5)) (or (and .cse4 .cse5 (= ~x~0_Out573096659 ~x$w_buff0~0_In573096659)) (and .cse3 (or (and (= ~x~0_Out573096659 ~x$w_buff1~0_In573096659) .cse0 .cse1) (and .cse2 (= ~x~0_Out573096659 ~x~0_In573096659))))) (= ~x$r_buff1_thd0~0_In573096659 ~x$r_buff1_thd0~0_Out573096659) (= ~x$r_buff0_thd0~0_In573096659 ~x$r_buff0_thd0~0_Out573096659)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In573096659, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In573096659, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In573096659|, ~x$w_buff1~0=~x$w_buff1~0_In573096659, ~x$w_buff1_used~0=~x$w_buff1_used~0_In573096659, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In573096659, ~x~0=~x~0_In573096659, ~x$w_buff0_used~0=~x$w_buff0_used~0_In573096659} OutVars{~x$w_buff0~0=~x$w_buff0~0_In573096659, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out573096659, ~x$w_buff1~0=~x$w_buff1~0_In573096659, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out573096659|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out573096659, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out573096659, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out573096659|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out573096659|, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out573096659|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out573096659, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out573096659|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In573096659|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out573096659|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out573096659, ~x~0=~x~0_Out573096659} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ~x~0, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2020-10-16 12:03:34,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:03:34,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,763 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:03:34,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,763 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:03:34,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,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:03:34,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,771 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:03:34,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,771 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:03:34,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,772 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:03:34,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,772 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:03:34,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,772 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:03:34,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,773 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:03:34,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,773 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:03:34,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,773 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:03:34,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:34,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:03:34 BasicIcfg [2020-10-16 12:03:34,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:03:34,887 INFO L168 Benchmark]: Toolchain (without parser) took 19316.21 ms. Allocated memory was 138.9 MB in the beginning and 548.9 MB in the end (delta: 410.0 MB). Free memory was 100.6 MB in the beginning and 328.1 MB in the end (delta: -227.5 MB). Peak memory consumption was 182.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:34,891 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.1 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-16 12:03:34,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.61 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 100.2 MB in the beginning and 156.7 MB in the end (delta: -56.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:34,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.47 ms. Allocated memory is still 201.9 MB. Free memory was 156.7 MB in the beginning and 153.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:34,892 INFO L168 Benchmark]: Boogie Preprocessor took 42.26 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 150.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:34,893 INFO L168 Benchmark]: RCFGBuilder took 2126.57 ms. Allocated memory was 201.9 MB in the beginning and 252.2 MB in the end (delta: 50.3 MB). Free memory was 150.6 MB in the beginning and 147.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:34,894 INFO L168 Benchmark]: TraceAbstraction took 16300.11 ms. Allocated memory was 252.2 MB in the beginning and 548.9 MB in the end (delta: 296.7 MB). Free memory was 147.4 MB in the beginning and 328.1 MB in the end (delta: -180.7 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:34,897 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.40 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.1 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 776.61 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 100.2 MB in the beginning and 156.7 MB in the end (delta: -56.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.47 ms. Allocated memory is still 201.9 MB. Free memory was 156.7 MB in the beginning and 153.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.26 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 150.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2126.57 ms. Allocated memory was 201.9 MB in the beginning and 252.2 MB in the end (delta: 50.3 MB). Free memory was 150.6 MB in the beginning and 147.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16300.11 ms. Allocated memory was 252.2 MB in the beginning and 548.9 MB in the end (delta: 296.7 MB). Free memory was 147.4 MB in the beginning and 328.1 MB in the end (delta: -180.7 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1495 VarBasedMoverChecksPositive, 53 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 172 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.3s, 125 PlacesBefore, 47 PlacesAfterwards, 114 TransitionsBefore, 34 TransitionsAfterwards, 2806 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 8039 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L709] 0 int b = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L714] 0 _Bool x$flush_delayed; [L715] 0 int x$mem_tmp; [L716] 0 _Bool x$r_buff0_thd0; [L717] 0 _Bool x$r_buff0_thd1; [L718] 0 _Bool x$r_buff0_thd2; [L719] 0 _Bool x$r_buff0_thd3; [L720] 0 _Bool x$r_buff0_thd4; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$r_buff1_thd3; [L725] 0 _Bool x$r_buff1_thd4; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L845] 0 pthread_t t1185; [L846] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L847] 0 pthread_t t1186; [L848] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L771] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L849] 0 pthread_t t1187; [L850] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] 0 pthread_t t1188; [L852] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 4 z = 2 [L814] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L801] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L804] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 3 return 0; [L817] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L820] 4 __unbuffered_p3_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L823] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L823] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L824] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L824] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L825] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L826] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L827] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L741] 1 b = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L744] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 2 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L830] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 4 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L866] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L867] 0 x$flush_delayed = weak$$choice2 [L868] 0 x$mem_tmp = x [L869] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L869] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L870] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L870] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L871] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L871] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L872] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L872] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L874] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L875] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L877] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L877] 0 x = x$flush_delayed ? x$mem_tmp : x [L878] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 113 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 530 SDtfs, 795 SDslu, 918 SDs, 0 SdLazy, 435 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4872occurred 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: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 972 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 71247 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...