/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/mix041_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:59:23,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:59:23,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:59:23,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:59:23,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:59:23,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:59:23,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:59:23,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:59:23,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:59:23,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:59:23,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:59:23,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:59:23,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:59:23,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:59:23,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:59:23,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:59:23,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:59:23,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:59:23,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:59:23,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:59:23,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:59:23,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:59:23,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:59:23,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:59:23,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:59:23,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:59:23,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:59:23,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:59:23,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:59:23,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:59:23,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:59:23,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:59:23,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:59:23,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:59:23,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:59:23,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:59:23,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:59:23,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:59:23,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:59:23,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:59:23,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:59:23,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 22:59:23,483 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:59:23,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:59:23,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:59:23,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:59:23,485 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:59:23,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:59:23,486 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:59:23,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:59:23,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:59:23,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:59:23,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:59:23,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:59:23,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:59:23,488 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:59:23,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:59:23,488 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:59:23,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:59:23,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:59:23,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:59:23,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:59:23,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:59:23,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:59:23,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:59:23,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 22:59:23,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:59:23,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:59:23,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:59:23,491 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 22:59:23,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:59:23,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:59:23,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:59:23,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:59:23,806 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:59:23,807 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:59:23,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_rmo.opt.i [2020-10-21 22:59:23,865 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f365625a/7a25a24c94f941bca8b0f97a1eb9fab2/FLAG700ea9bc3 [2020-10-21 22:59:24,426 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:59:24,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_rmo.opt.i [2020-10-21 22:59:24,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f365625a/7a25a24c94f941bca8b0f97a1eb9fab2/FLAG700ea9bc3 [2020-10-21 22:59:24,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f365625a/7a25a24c94f941bca8b0f97a1eb9fab2 [2020-10-21 22:59:24,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:59:24,709 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:59:24,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:59:24,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:59:24,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:59:24,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:59:24" (1/1) ... [2020-10-21 22:59:24,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31fcfac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:24, skipping insertion in model container [2020-10-21 22:59:24,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:59:24" (1/1) ... [2020-10-21 22:59:24,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:59:24,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:59:25,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:59:25,339 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:59:25,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:59:25,523 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:59:25,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25 WrapperNode [2020-10-21 22:59:25,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:59:25,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:59:25,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:59:25,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:59:25,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25" (1/1) ... [2020-10-21 22:59:25,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25" (1/1) ... [2020-10-21 22:59:25,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:59:25,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:59:25,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:59:25,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:59:25,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25" (1/1) ... [2020-10-21 22:59:25,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25" (1/1) ... [2020-10-21 22:59:25,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25" (1/1) ... [2020-10-21 22:59:25,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25" (1/1) ... [2020-10-21 22:59:25,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25" (1/1) ... [2020-10-21 22:59:25,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25" (1/1) ... [2020-10-21 22:59:25,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25" (1/1) ... [2020-10-21 22:59:25,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:59:25,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:59:25,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:59:25,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:59:25,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-21 22:59:25,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:59:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:59:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:59:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:59:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:59:25,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:59:25,767 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:59:25,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:59:25,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:59:25,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:59:25,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:59:25,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:59:25,775 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 22:59:27,837 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:59:27,838 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:59:27,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:59:27 BoogieIcfgContainer [2020-10-21 22:59:27,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:59:27,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:59:27,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:59:27,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:59:27,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:59:24" (1/3) ... [2020-10-21 22:59:27,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ddbac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:59:27, skipping insertion in model container [2020-10-21 22:59:27,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25" (2/3) ... [2020-10-21 22:59:27,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ddbac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:59:27, skipping insertion in model container [2020-10-21 22:59:27,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:59:27" (3/3) ... [2020-10-21 22:59:27,850 INFO L111 eAbstractionObserver]: Analyzing ICFG mix041_rmo.opt.i [2020-10-21 22:59:27,862 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:59:27,862 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:59:27,871 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:59:27,872 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:59:27,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,901 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,901 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,904 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,904 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,905 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,906 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,906 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,906 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,906 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,906 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,906 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,909 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,914 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,915 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,919 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,921 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,921 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:27,923 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:59:27,938 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-21 22:59:27,960 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:59:27,961 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:59:27,961 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 22:59:27,961 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:59:27,961 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:59:27,961 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:59:27,962 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:59:27,962 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:59:27,976 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 22:59:27,977 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 88 transitions, 186 flow [2020-10-21 22:59:27,980 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 88 transitions, 186 flow [2020-10-21 22:59:27,982 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 92 places, 88 transitions, 186 flow [2020-10-21 22:59:28,028 INFO L129 PetriNetUnfolder]: 3/86 cut-off events. [2020-10-21 22:59:28,028 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:59:28,033 INFO L80 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 3/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2020-10-21 22:59:28,036 INFO L116 LiptonReduction]: Number of co-enabled transitions 1182 [2020-10-21 22:59:28,384 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 22:59:28,509 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-21 22:59:28,650 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-21 22:59:29,317 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 22:59:29,756 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 22:59:29,882 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 22:59:31,974 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-21 22:59:32,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-21 22:59:32,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:59:32,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:59:32,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:59:32,828 WARN L193 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-21 22:59:34,016 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 229 DAG size of output: 189 [2020-10-21 22:59:34,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-21 22:59:34,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:59:34,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:59:34,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:59:35,060 WARN L193 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 109 [2020-10-21 22:59:36,092 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 136 DAG size of output: 127 [2020-10-21 22:59:36,461 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-21 22:59:36,593 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-21 22:59:36,714 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-21 22:59:37,094 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-10-21 22:59:37,272 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-21 22:59:37,296 INFO L131 LiptonReduction]: Checked pairs total: 3208 [2020-10-21 22:59:37,297 INFO L133 LiptonReduction]: Total number of compositions: 87 [2020-10-21 22:59:37,310 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 20 transitions, 50 flow [2020-10-21 22:59:37,339 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 187 states. [2020-10-21 22:59:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states. [2020-10-21 22:59:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 22:59:37,361 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:37,362 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 22:59:37,363 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:37,369 INFO L82 PathProgramCache]: Analyzing trace with hash 926823553, now seen corresponding path program 1 times [2020-10-21 22:59:37,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:37,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729694620] [2020-10-21 22:59:37,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:37,650 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-21 22:59:37,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729694620] [2020-10-21 22:59:37,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:37,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:59:37,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243707691] [2020-10-21 22:59:37,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:59:37,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:59:37,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:59:37,678 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 3 states. [2020-10-21 22:59:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:37,750 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2020-10-21 22:59:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:59:37,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 22:59:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:37,765 INFO L225 Difference]: With dead ends: 162 [2020-10-21 22:59:37,766 INFO L226 Difference]: Without dead ends: 132 [2020-10-21 22:59:37,767 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-21 22:59:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-21 22:59:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-21 22:59:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-21 22:59:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 306 transitions. [2020-10-21 22:59:37,821 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 306 transitions. Word has length 5 [2020-10-21 22:59:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:37,822 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 306 transitions. [2020-10-21 22:59:37,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:59:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 306 transitions. [2020-10-21 22:59:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 22:59:37,823 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:37,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:37,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 22:59:37,824 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:37,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:37,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1619268401, now seen corresponding path program 1 times [2020-10-21 22:59:37,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:37,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740692503] [2020-10-21 22:59:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:37,973 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-21 22:59:37,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740692503] [2020-10-21 22:59:37,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:37,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:59:37,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201719016] [2020-10-21 22:59:37,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:59:37,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:37,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:59:37,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:59:37,978 INFO L87 Difference]: Start difference. First operand 132 states and 306 transitions. Second operand 3 states. [2020-10-21 22:59:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:37,991 INFO L93 Difference]: Finished difference Result 122 states and 278 transitions. [2020-10-21 22:59:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:59:37,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 22:59:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:37,994 INFO L225 Difference]: With dead ends: 122 [2020-10-21 22:59:37,994 INFO L226 Difference]: Without dead ends: 122 [2020-10-21 22:59:37,995 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-21 22:59:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-21 22:59:38,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-10-21 22:59:38,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-21 22:59:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 278 transitions. [2020-10-21 22:59:38,010 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 278 transitions. Word has length 7 [2020-10-21 22:59:38,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:38,011 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 278 transitions. [2020-10-21 22:59:38,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:59:38,011 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 278 transitions. [2020-10-21 22:59:38,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 22:59:38,012 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:38,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:38,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 22:59:38,012 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:38,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:38,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1303932898, now seen corresponding path program 1 times [2020-10-21 22:59:38,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:38,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018985352] [2020-10-21 22:59:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:38,196 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-21 22:59:38,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018985352] [2020-10-21 22:59:38,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:38,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:59:38,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940413830] [2020-10-21 22:59:38,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:59:38,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:38,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:59:38,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:59:38,198 INFO L87 Difference]: Start difference. First operand 122 states and 278 transitions. Second operand 5 states. [2020-10-21 22:59:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:38,283 INFO L93 Difference]: Finished difference Result 118 states and 266 transitions. [2020-10-21 22:59:38,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:59:38,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-21 22:59:38,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:38,286 INFO L225 Difference]: With dead ends: 118 [2020-10-21 22:59:38,286 INFO L226 Difference]: Without dead ends: 118 [2020-10-21 22:59:38,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:59:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-21 22:59:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2020-10-21 22:59:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-10-21 22:59:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 266 transitions. [2020-10-21 22:59:38,297 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 266 transitions. Word has length 9 [2020-10-21 22:59:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:38,297 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 266 transitions. [2020-10-21 22:59:38,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:59:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 266 transitions. [2020-10-21 22:59:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:59:38,299 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:38,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:38,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 22:59:38,299 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:38,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:38,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2002665435, now seen corresponding path program 1 times [2020-10-21 22:59:38,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:38,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671009448] [2020-10-21 22:59:38,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:38,470 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-21 22:59:38,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671009448] [2020-10-21 22:59:38,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:38,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:59:38,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410855012] [2020-10-21 22:59:38,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:59:38,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:38,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:59:38,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:59:38,473 INFO L87 Difference]: Start difference. First operand 118 states and 266 transitions. Second operand 6 states. [2020-10-21 22:59:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:38,585 INFO L93 Difference]: Finished difference Result 128 states and 292 transitions. [2020-10-21 22:59:38,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:59:38,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-21 22:59:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:38,593 INFO L225 Difference]: With dead ends: 128 [2020-10-21 22:59:38,593 INFO L226 Difference]: Without dead ends: 128 [2020-10-21 22:59:38,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:59:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-10-21 22:59:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-10-21 22:59:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-21 22:59:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 292 transitions. [2020-10-21 22:59:38,618 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 292 transitions. Word has length 11 [2020-10-21 22:59:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:38,618 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 292 transitions. [2020-10-21 22:59:38,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:59:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 292 transitions. [2020-10-21 22:59:38,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:59:38,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:38,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:38,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 22:59:38,622 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:38,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1967867625, now seen corresponding path program 2 times [2020-10-21 22:59:38,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:38,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117815017] [2020-10-21 22:59:38,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:38,788 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-21 22:59:38,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117815017] [2020-10-21 22:59:38,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:38,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:59:38,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24380746] [2020-10-21 22:59:38,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:59:38,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:38,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:59:38,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:59:38,791 INFO L87 Difference]: Start difference. First operand 128 states and 292 transitions. Second operand 6 states. [2020-10-21 22:59:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:39,039 INFO L93 Difference]: Finished difference Result 144 states and 325 transitions. [2020-10-21 22:59:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:59:39,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-21 22:59:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:39,042 INFO L225 Difference]: With dead ends: 144 [2020-10-21 22:59:39,042 INFO L226 Difference]: Without dead ends: 144 [2020-10-21 22:59:39,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:59:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-21 22:59:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2020-10-21 22:59:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-21 22:59:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 299 transitions. [2020-10-21 22:59:39,053 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 299 transitions. Word has length 11 [2020-10-21 22:59:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:39,053 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 299 transitions. [2020-10-21 22:59:39,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:59:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 299 transitions. [2020-10-21 22:59:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:59:39,054 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:39,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:39,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 22:59:39,055 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:39,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:39,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1050992703, now seen corresponding path program 1 times [2020-10-21 22:59:39,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:39,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031514110] [2020-10-21 22:59:39,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:39,149 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-21 22:59:39,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031514110] [2020-10-21 22:59:39,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:39,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:59:39,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51092544] [2020-10-21 22:59:39,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:59:39,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:39,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:59:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:59:39,151 INFO L87 Difference]: Start difference. First operand 134 states and 299 transitions. Second operand 4 states. [2020-10-21 22:59:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:39,189 INFO L93 Difference]: Finished difference Result 118 states and 224 transitions. [2020-10-21 22:59:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:59:39,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 22:59:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:39,191 INFO L225 Difference]: With dead ends: 118 [2020-10-21 22:59:39,191 INFO L226 Difference]: Without dead ends: 82 [2020-10-21 22:59:39,191 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-21 22:59:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-21 22:59:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-21 22:59:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-21 22:59:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 143 transitions. [2020-10-21 22:59:39,196 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 143 transitions. Word has length 11 [2020-10-21 22:59:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:39,196 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 143 transitions. [2020-10-21 22:59:39,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:59:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 143 transitions. [2020-10-21 22:59:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 22:59:39,198 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:39,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:39,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 22:59:39,198 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:39,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1546414654, now seen corresponding path program 1 times [2020-10-21 22:59:39,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:39,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295994041] [2020-10-21 22:59:39,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:39,345 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-21 22:59:39,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295994041] [2020-10-21 22:59:39,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:39,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:59:39,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019287099] [2020-10-21 22:59:39,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:59:39,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:39,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:59:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:59:39,348 INFO L87 Difference]: Start difference. First operand 82 states and 143 transitions. Second operand 5 states. [2020-10-21 22:59:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:39,386 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2020-10-21 22:59:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:59:39,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 22:59:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:39,388 INFO L225 Difference]: With dead ends: 64 [2020-10-21 22:59:39,388 INFO L226 Difference]: Without dead ends: 51 [2020-10-21 22:59:39,389 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-21 22:59:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-21 22:59:39,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-10-21 22:59:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-21 22:59:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2020-10-21 22:59:39,392 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 12 [2020-10-21 22:59:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:39,392 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2020-10-21 22:59:39,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:59:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2020-10-21 22:59:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:59:39,393 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:39,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:39,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 22:59:39,393 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:39,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:39,394 INFO L82 PathProgramCache]: Analyzing trace with hash 258980126, now seen corresponding path program 1 times [2020-10-21 22:59:39,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:39,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787390374] [2020-10-21 22:59:39,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:39,479 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-21 22:59:39,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787390374] [2020-10-21 22:59:39,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:39,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:59:39,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203775520] [2020-10-21 22:59:39,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:59:39,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:39,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:59:39,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:59:39,482 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 6 states. [2020-10-21 22:59:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:39,575 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2020-10-21 22:59:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:59:39,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-21 22:59:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:39,578 INFO L225 Difference]: With dead ends: 67 [2020-10-21 22:59:39,578 INFO L226 Difference]: Without dead ends: 33 [2020-10-21 22:59:39,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:59:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-10-21 22:59:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-10-21 22:59:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-21 22:59:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2020-10-21 22:59:39,581 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 16 [2020-10-21 22:59:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:39,581 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2020-10-21 22:59:39,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:59:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2020-10-21 22:59:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:59:39,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:39,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:39,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 22:59:39,582 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:39,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1217479710, now seen corresponding path program 2 times [2020-10-21 22:59:39,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:39,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162537277] [2020-10-21 22:59:39,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:39,663 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-21 22:59:39,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162537277] [2020-10-21 22:59:39,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:39,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:59:39,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177099605] [2020-10-21 22:59:39,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:59:39,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:39,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:59:39,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:59:39,665 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 5 states. [2020-10-21 22:59:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:39,703 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2020-10-21 22:59:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:59:39,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 22:59:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:39,705 INFO L225 Difference]: With dead ends: 47 [2020-10-21 22:59:39,705 INFO L226 Difference]: Without dead ends: 25 [2020-10-21 22:59:39,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:59:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-21 22:59:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-21 22:59:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-21 22:59:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-21 22:59:39,708 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2020-10-21 22:59:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:39,708 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-21 22:59:39,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:59:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-10-21 22:59:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:59:39,709 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:39,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:39,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 22:59:39,710 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:39,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:39,710 INFO L82 PathProgramCache]: Analyzing trace with hash 598532766, now seen corresponding path program 3 times [2020-10-21 22:59:39,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:39,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234354215] [2020-10-21 22:59:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:39,845 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-21 22:59:39,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234354215] [2020-10-21 22:59:39,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:39,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:59:39,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694549334] [2020-10-21 22:59:39,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:59:39,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:39,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:59:39,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:59:39,847 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 7 states. [2020-10-21 22:59:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:39,956 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2020-10-21 22:59:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:59:39,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-21 22:59:39,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:39,958 INFO L225 Difference]: With dead ends: 33 [2020-10-21 22:59:39,958 INFO L226 Difference]: Without dead ends: 21 [2020-10-21 22:59:39,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:59:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-10-21 22:59:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-21 22:59:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-21 22:59:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-10-21 22:59:39,960 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2020-10-21 22:59:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:39,960 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-10-21 22:59:39,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:59:39,961 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-10-21 22:59:39,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:59:39,961 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:39,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:39,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 22:59:39,962 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:39,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:39,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1247248418, now seen corresponding path program 4 times [2020-10-21 22:59:39,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:39,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735638527] [2020-10-21 22:59:39,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:59:40,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:59:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:59:40,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:59:40,108 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 22:59:40,109 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 22:59:40,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 22:59:40,110 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 22:59:40,119 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L809-->L816: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In-612467078 256) 0)) (.cse6 (= (mod ~x$w_buff1_used~0_In-612467078 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In-612467078 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In-612467078 256) 0))) (let ((.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse3 (or .cse8 .cse9)) (.cse2 (or .cse7 .cse6)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (or (and (or (and .cse0 (= ~x~0_Out-612467078 ~x$w_buff1~0_In-612467078) .cse1) (and .cse2 (= ~x~0_Out-612467078 ~x~0_In-612467078))) .cse3) (and (= ~x~0_Out-612467078 ~x$w_buff0~0_In-612467078) .cse4 .cse5)) (or (and .cse4 (= ~x$w_buff0_used~0_Out-612467078 0) .cse5) (and (= ~x$w_buff0_used~0_Out-612467078 ~x$w_buff0_used~0_In-612467078) .cse3)) (= ~x$r_buff0_thd0~0_In-612467078 ~x$r_buff0_thd0~0_Out-612467078) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-612467078 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-612467078|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-612467078 0)) (= ~x$r_buff1_thd0~0_Out-612467078 ~x$r_buff1_thd0~0_In-612467078) (or (and (= ~x$w_buff1_used~0_Out-612467078 ~x$w_buff1_used~0_In-612467078) .cse2) (and (= ~x$w_buff1_used~0_Out-612467078 0) .cse0 .cse1))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-612467078, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-612467078, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-612467078|, ~x$w_buff1~0=~x$w_buff1~0_In-612467078, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-612467078, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-612467078, ~x~0=~x~0_In-612467078, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-612467078} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-612467078, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-612467078, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-612467078|, ~x$w_buff1~0=~x$w_buff1~0_In-612467078, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-612467078|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-612467078, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-612467078, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-612467078|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-612467078|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-612467078|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-612467078, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-612467078|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-612467078|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-612467078, ~x~0=~x~0_Out-612467078} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ULTIMATE.start_main_#t~ite22, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-21 22:59:40,124 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-21 22:59:40,125 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,125 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-21 22:59:40,125 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [759] [2020-10-21 22:59:40,127 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-21 22:59:40,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,129 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-21 22:59:40,129 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,129 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-21 22:59:40,130 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,130 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-21 22:59:40,130 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,130 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-21 22:59:40,130 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,130 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-21 22:59:40,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,131 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-21 22:59:40,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,131 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-21 22:59:40,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,131 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-21 22:59:40,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,132 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-21 22:59:40,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,132 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-21 22:59:40,133 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,133 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-21 22:59:40,133 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,134 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-21 22:59:40,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,134 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-21 22:59:40,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,135 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-21 22:59:40,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,135 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-21 22:59:40,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,136 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-21 22:59:40,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,142 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-21 22:59:40,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,142 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-21 22:59:40,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,143 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-21 22:59:40,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,143 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-21 22:59:40,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,143 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-21 22:59:40,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,144 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-21 22:59:40,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,144 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-21 22:59:40,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:59:40 BasicIcfg [2020-10-21 22:59:40,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 22:59:40,212 INFO L168 Benchmark]: Toolchain (without parser) took 15509.26 ms. Allocated memory was 143.7 MB in the beginning and 358.1 MB in the end (delta: 214.4 MB). Free memory was 101.1 MB in the beginning and 306.8 MB in the end (delta: -205.7 MB). Peak memory consumption was 203.9 MB. Max. memory is 7.1 GB. [2020-10-21 22:59:40,213 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 121.1 MB in the beginning and 120.7 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-21 22:59:40,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.10 ms. Allocated memory was 143.7 MB in the beginning and 205.0 MB in the end (delta: 61.3 MB). Free memory was 100.3 MB in the beginning and 158.0 MB in the end (delta: -57.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-10-21 22:59:40,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.43 ms. Allocated memory is still 205.0 MB. Free memory was 158.0 MB in the beginning and 155.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:59:40,215 INFO L168 Benchmark]: Boogie Preprocessor took 37.51 ms. Allocated memory is still 205.0 MB. Free memory was 155.1 MB in the beginning and 152.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:59:40,216 INFO L168 Benchmark]: RCFGBuilder took 2183.37 ms. Allocated memory was 205.0 MB in the beginning and 245.4 MB in the end (delta: 40.4 MB). Free memory was 152.1 MB in the beginning and 186.9 MB in the end (delta: -34.8 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. [2020-10-21 22:59:40,217 INFO L168 Benchmark]: TraceAbstraction took 12368.56 ms. Allocated memory was 245.4 MB in the beginning and 358.1 MB in the end (delta: 112.7 MB). Free memory was 186.9 MB in the beginning and 306.8 MB in the end (delta: -119.9 MB). Peak memory consumption was 188.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:59:40,221 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 121.1 MB in the beginning and 120.7 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.10 ms. Allocated memory was 143.7 MB in the beginning and 205.0 MB in the end (delta: 61.3 MB). Free memory was 100.3 MB in the beginning and 158.0 MB in the end (delta: -57.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.43 ms. Allocated memory is still 205.0 MB. Free memory was 158.0 MB in the beginning and 155.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.51 ms. Allocated memory is still 205.0 MB. Free memory was 155.1 MB in the beginning and 152.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2183.37 ms. Allocated memory was 205.0 MB in the beginning and 245.4 MB in the end (delta: 40.4 MB). Free memory was 152.1 MB in the beginning and 186.9 MB in the end (delta: -34.8 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12368.56 ms. Allocated memory was 245.4 MB in the beginning and 358.1 MB in the end (delta: 112.7 MB). Free memory was 186.9 MB in the beginning and 306.8 MB in the end (delta: -119.9 MB). Peak memory consumption was 188.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 659 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 42 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.3s, 92 PlacesBefore, 27 PlacesAfterwards, 88 TransitionsBefore, 20 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, 3208 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1099; [L803] FCALL, FORK 0 pthread_create(&t1099, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1100; [L805] FCALL, FORK 0 pthread_create(&t1100, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L18] COND TRUE 2 !expression [L17] COND FALSE 2 !(0) [L17] 2 __assert_fail ("0", "mix041_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 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) [L780] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L780] 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) [L780] 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) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 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 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 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 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L746] 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) [L746] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L746] 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) [L746] 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) [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] 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 [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 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 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 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) [L822] 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) [L823] 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)) [L823] 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)) [L824] 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)) [L824] EXPR 0 !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) [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L824] EXPR 0 !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) [L824] 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)) [L824] 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)) [L825] 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)) [L825] EXPR 0 !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) [L825] 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)) [L825] 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)) [L826] 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)) [L826] 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)) [L827] 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)) [L827] EXPR 0 !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) [L827] 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)) [L827] 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)) [L828] 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)) [L828] 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)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix041_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 86 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.1s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 169 SDtfs, 159 SDslu, 258 SDs, 0 SdLazy, 216 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 9293 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...