/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/mix047_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:34:12,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:34:12,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:34:12,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:34:12,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:34:12,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:34:12,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:34:12,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:34:12,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:34:12,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:34:12,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:34:12,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:34:12,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:34:12,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:34:12,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:34:12,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:34:12,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:34:12,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:34:12,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:34:12,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:34:12,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:34:12,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:34:12,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:34:12,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:34:12,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:34:12,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:34:12,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:34:12,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:34:12,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:34:12,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:34:12,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:34:12,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:34:12,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:34:12,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:34:12,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:34:12,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:34:12,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:34:12,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:34:12,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:34:12,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:34:12,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:34:12,999 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-05 23:34:13,020 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:34:13,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:34:13,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:34:13,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:34:13,022 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:34:13,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:34:13,022 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:34:13,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:34:13,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:34:13,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:34:13,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:34:13,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:34:13,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:34:13,024 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:34:13,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:34:13,024 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:34:13,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:34:13,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:34:13,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:34:13,025 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:34:13,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:34:13,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:34:13,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:34:13,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:34:13,026 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:34:13,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:34:13,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:34:13,026 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:34:13,027 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:34:13,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:34:13,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:34:13,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:34:13,312 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:34:13,313 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:34:13,313 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_pso.oepc.i [2020-10-05 23:34:13,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e38f0bd6/b31214cfc1b74cd0a02c5eadac8d162c/FLAG88fa2cc00 [2020-10-05 23:34:13,941 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:34:13,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_pso.oepc.i [2020-10-05 23:34:13,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e38f0bd6/b31214cfc1b74cd0a02c5eadac8d162c/FLAG88fa2cc00 [2020-10-05 23:34:14,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e38f0bd6/b31214cfc1b74cd0a02c5eadac8d162c [2020-10-05 23:34:14,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:34:14,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:34:14,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:34:14,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:34:14,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:34:14,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:34:14" (1/1) ... [2020-10-05 23:34:14,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592eedb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:14, skipping insertion in model container [2020-10-05 23:34:14,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:34:14" (1/1) ... [2020-10-05 23:34:14,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:34:14,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:34:14,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:34:14,954 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:34:15,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:34:15,195 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:34:15,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:15 WrapperNode [2020-10-05 23:34:15,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:34:15,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:34:15,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:34:15,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:34:15,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:15" (1/1) ... [2020-10-05 23:34:15,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:15" (1/1) ... [2020-10-05 23:34:15,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:34:15,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:34:15,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:34:15,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:34:15,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:15" (1/1) ... [2020-10-05 23:34:15,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:15" (1/1) ... [2020-10-05 23:34:15,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:15" (1/1) ... [2020-10-05 23:34:15,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:15" (1/1) ... [2020-10-05 23:34:15,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:15" (1/1) ... [2020-10-05 23:34:15,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:15" (1/1) ... [2020-10-05 23:34:15,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:15" (1/1) ... [2020-10-05 23:34:15,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:34:15,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:34:15,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:34:15,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:34:15,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:15" (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-05 23:34:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:34:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:34:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:34:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:34:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:34:15,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:34:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:34:15,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:34:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:34:15,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:34:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 23:34:15,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 23:34:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:34:15,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:34:15,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:34:15,405 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:34:17,628 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:34:17,629 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:34:17,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:34:17 BoogieIcfgContainer [2020-10-05 23:34:17,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:34:17,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:34:17,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:34:17,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:34:17,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:34:14" (1/3) ... [2020-10-05 23:34:17,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ca5e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:34:17, skipping insertion in model container [2020-10-05 23:34:17,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:15" (2/3) ... [2020-10-05 23:34:17,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ca5e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:34:17, skipping insertion in model container [2020-10-05 23:34:17,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:34:17" (3/3) ... [2020-10-05 23:34:17,640 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_pso.oepc.i [2020-10-05 23:34:17,650 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:34:17,651 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:34:17,660 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:34:17,661 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:34:17,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,698 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,698 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,698 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,699 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,702 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,702 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,705 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,705 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,708 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,708 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,715 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,715 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,715 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,718 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,718 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,718 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,723 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,728 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,729 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,735 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,735 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,744 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,745 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,745 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:17,761 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:34:17,783 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:34:17,784 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:34:17,784 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:34:17,784 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:34:17,784 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:34:17,784 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:34:17,784 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:34:17,785 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:34:17,802 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 246 flow [2020-10-05 23:34:17,804 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-10-05 23:34:17,859 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-05 23:34:17,860 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:34:17,869 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-05 23:34:17,874 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-10-05 23:34:17,899 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-05 23:34:17,899 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:34:17,900 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-05 23:34:17,904 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2814 [2020-10-05 23:34:17,905 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:34:19,159 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 23:34:19,280 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:34:20,083 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-05 23:34:20,223 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-05 23:34:20,572 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-05 23:34:20,699 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-05 23:34:20,712 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7711 [2020-10-05 23:34:20,712 INFO L214 etLargeBlockEncoding]: Total number of compositions: 85 [2020-10-05 23:34:20,716 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-10-05 23:34:21,019 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4874 states. [2020-10-05 23:34:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states. [2020-10-05 23:34:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:34:21,028 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:21,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:34:21,030 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:21,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:21,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1195809, now seen corresponding path program 1 times [2020-10-05 23:34:21,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:21,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910916976] [2020-10-05 23:34:21,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:21,279 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-05 23:34:21,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910916976] [2020-10-05 23:34:21,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:21,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:34:21,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119408276] [2020-10-05 23:34:21,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:34:21,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:21,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:34:21,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:34:21,349 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 3 states. [2020-10-05 23:34:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:21,494 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-10-05 23:34:21,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:34:21,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:34:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:21,551 INFO L225 Difference]: With dead ends: 4062 [2020-10-05 23:34:21,551 INFO L226 Difference]: Without dead ends: 3312 [2020-10-05 23:34:21,553 INFO L675 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-05 23:34:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-10-05 23:34:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-10-05 23:34:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-10-05 23:34:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-10-05 23:34:21,803 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 3 [2020-10-05 23:34:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:21,803 INFO L479 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-10-05 23:34:21,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:34:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-10-05 23:34:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:34:21,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:21,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:21,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:34:21,813 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:21,820 INFO L82 PathProgramCache]: Analyzing trace with hash 274388079, now seen corresponding path program 1 times [2020-10-05 23:34:21,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:21,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677732398] [2020-10-05 23:34:21,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:21,924 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-05 23:34:21,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677732398] [2020-10-05 23:34:21,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:21,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:34:21,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77950972] [2020-10-05 23:34:21,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:34:21,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:21,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:34:21,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:34:21,927 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-10-05 23:34:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:21,970 INFO L93 Difference]: Finished difference Result 3252 states and 12672 transitions. [2020-10-05 23:34:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:34:21,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:34:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:21,999 INFO L225 Difference]: With dead ends: 3252 [2020-10-05 23:34:21,999 INFO L226 Difference]: Without dead ends: 3252 [2020-10-05 23:34:22,000 INFO L675 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-05 23:34:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2020-10-05 23:34:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 3252. [2020-10-05 23:34:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3252 states. [2020-10-05 23:34:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 12672 transitions. [2020-10-05 23:34:22,127 INFO L78 Accepts]: Start accepts. Automaton has 3252 states and 12672 transitions. Word has length 11 [2020-10-05 23:34:22,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:22,128 INFO L479 AbstractCegarLoop]: Abstraction has 3252 states and 12672 transitions. [2020-10-05 23:34:22,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:34:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3252 states and 12672 transitions. [2020-10-05 23:34:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:34:22,132 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:22,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:22,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:34:22,132 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:22,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:22,133 INFO L82 PathProgramCache]: Analyzing trace with hash -83904800, now seen corresponding path program 1 times [2020-10-05 23:34:22,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:22,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74882601] [2020-10-05 23:34:22,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:22,190 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-05 23:34:22,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74882601] [2020-10-05 23:34:22,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:22,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:34:22,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243765670] [2020-10-05 23:34:22,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:34:22,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:22,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:34:22,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:34:22,192 INFO L87 Difference]: Start difference. First operand 3252 states and 12672 transitions. Second operand 3 states. [2020-10-05 23:34:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:22,231 INFO L93 Difference]: Finished difference Result 3204 states and 12452 transitions. [2020-10-05 23:34:22,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:34:22,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:34:22,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:22,259 INFO L225 Difference]: With dead ends: 3204 [2020-10-05 23:34:22,259 INFO L226 Difference]: Without dead ends: 3204 [2020-10-05 23:34:22,259 INFO L675 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-05 23:34:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2020-10-05 23:34:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 3204. [2020-10-05 23:34:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3204 states. [2020-10-05 23:34:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 12452 transitions. [2020-10-05 23:34:22,460 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 12452 transitions. Word has length 12 [2020-10-05 23:34:22,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:22,460 INFO L479 AbstractCegarLoop]: Abstraction has 3204 states and 12452 transitions. [2020-10-05 23:34:22,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:34:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 12452 transitions. [2020-10-05 23:34:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:34:22,463 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:22,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:22,463 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:34:22,464 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:22,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:22,464 INFO L82 PathProgramCache]: Analyzing trace with hash 222562512, now seen corresponding path program 1 times [2020-10-05 23:34:22,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:22,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051660330] [2020-10-05 23:34:22,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:22,510 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-05 23:34:22,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051660330] [2020-10-05 23:34:22,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:22,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:34:22,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217053065] [2020-10-05 23:34:22,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:34:22,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:22,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:34:22,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:34:22,512 INFO L87 Difference]: Start difference. First operand 3204 states and 12452 transitions. Second operand 3 states. [2020-10-05 23:34:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:22,554 INFO L93 Difference]: Finished difference Result 4674 states and 17563 transitions. [2020-10-05 23:34:22,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:34:22,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-05 23:34:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:22,584 INFO L225 Difference]: With dead ends: 4674 [2020-10-05 23:34:22,584 INFO L226 Difference]: Without dead ends: 3474 [2020-10-05 23:34:22,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:34:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2020-10-05 23:34:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3114. [2020-10-05 23:34:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-10-05 23:34:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 11665 transitions. [2020-10-05 23:34:22,692 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 11665 transitions. Word has length 13 [2020-10-05 23:34:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:22,692 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 11665 transitions. [2020-10-05 23:34:22,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:34:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 11665 transitions. [2020-10-05 23:34:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:34:22,695 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:22,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:22,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:34:22,695 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1686434293, now seen corresponding path program 1 times [2020-10-05 23:34:22,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:22,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799264895] [2020-10-05 23:34:22,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:22,758 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-05 23:34:22,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799264895] [2020-10-05 23:34:22,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:22,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:34:22,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019452864] [2020-10-05 23:34:22,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:34:22,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:22,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:34:22,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:34:22,765 INFO L87 Difference]: Start difference. First operand 3114 states and 11665 transitions. Second operand 3 states. [2020-10-05 23:34:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:22,797 INFO L93 Difference]: Finished difference Result 2930 states and 10871 transitions. [2020-10-05 23:34:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:34:22,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-05 23:34:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:22,812 INFO L225 Difference]: With dead ends: 2930 [2020-10-05 23:34:22,812 INFO L226 Difference]: Without dead ends: 2930 [2020-10-05 23:34:22,812 INFO L675 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-05 23:34:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-10-05 23:34:22,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2930. [2020-10-05 23:34:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2930 states. [2020-10-05 23:34:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 10871 transitions. [2020-10-05 23:34:22,912 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 10871 transitions. Word has length 13 [2020-10-05 23:34:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:22,913 INFO L479 AbstractCegarLoop]: Abstraction has 2930 states and 10871 transitions. [2020-10-05 23:34:22,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:34:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 10871 transitions. [2020-10-05 23:34:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:34:22,917 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:22,917 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:22,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:34:22,918 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:22,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash 456392049, now seen corresponding path program 1 times [2020-10-05 23:34:22,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:22,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199275128] [2020-10-05 23:34:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:22,986 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-05 23:34:22,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199275128] [2020-10-05 23:34:22,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:22,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:34:22,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903138474] [2020-10-05 23:34:22,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:34:22,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:22,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:34:22,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:34:22,988 INFO L87 Difference]: Start difference. First operand 2930 states and 10871 transitions. Second operand 4 states. [2020-10-05 23:34:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:23,050 INFO L93 Difference]: Finished difference Result 2914 states and 9786 transitions. [2020-10-05 23:34:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:34:23,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-05 23:34:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:23,061 INFO L225 Difference]: With dead ends: 2914 [2020-10-05 23:34:23,061 INFO L226 Difference]: Without dead ends: 2164 [2020-10-05 23:34:23,061 INFO L675 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-05 23:34:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2020-10-05 23:34:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2164. [2020-10-05 23:34:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2164 states. [2020-10-05 23:34:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 7161 transitions. [2020-10-05 23:34:23,126 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 7161 transitions. Word has length 15 [2020-10-05 23:34:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:23,127 INFO L479 AbstractCegarLoop]: Abstraction has 2164 states and 7161 transitions. [2020-10-05 23:34:23,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:34:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 7161 transitions. [2020-10-05 23:34:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:34:23,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:23,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:23,131 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:34:23,132 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1103036714, now seen corresponding path program 1 times [2020-10-05 23:34:23,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:23,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444840889] [2020-10-05 23:34:23,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:23,274 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-05 23:34:23,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444840889] [2020-10-05 23:34:23,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:23,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:34:23,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359788413] [2020-10-05 23:34:23,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:34:23,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:34:23,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:34:23,276 INFO L87 Difference]: Start difference. First operand 2164 states and 7161 transitions. Second operand 3 states. [2020-10-05 23:34:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:23,307 INFO L93 Difference]: Finished difference Result 3229 states and 10392 transitions. [2020-10-05 23:34:23,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:34:23,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-10-05 23:34:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:23,317 INFO L225 Difference]: With dead ends: 3229 [2020-10-05 23:34:23,317 INFO L226 Difference]: Without dead ends: 2245 [2020-10-05 23:34:23,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:34:23,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2020-10-05 23:34:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2134. [2020-10-05 23:34:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2134 states. [2020-10-05 23:34:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 6763 transitions. [2020-10-05 23:34:23,379 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 6763 transitions. Word has length 18 [2020-10-05 23:34:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:23,380 INFO L479 AbstractCegarLoop]: Abstraction has 2134 states and 6763 transitions. [2020-10-05 23:34:23,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:34:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 6763 transitions. [2020-10-05 23:34:23,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:34:23,384 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:23,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:23,385 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:34:23,385 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:23,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:23,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1301697600, now seen corresponding path program 1 times [2020-10-05 23:34:23,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:23,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249076449] [2020-10-05 23:34:23,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:23,486 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-05 23:34:23,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249076449] [2020-10-05 23:34:23,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:23,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:34:23,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520268234] [2020-10-05 23:34:23,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:34:23,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:23,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:34:23,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:34:23,489 INFO L87 Difference]: Start difference. First operand 2134 states and 6763 transitions. Second operand 5 states. [2020-10-05 23:34:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:23,549 INFO L93 Difference]: Finished difference Result 1821 states and 5308 transitions. [2020-10-05 23:34:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:34:23,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-05 23:34:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:23,555 INFO L225 Difference]: With dead ends: 1821 [2020-10-05 23:34:23,555 INFO L226 Difference]: Without dead ends: 1391 [2020-10-05 23:34:23,556 INFO L675 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-05 23:34:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-10-05 23:34:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1391. [2020-10-05 23:34:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391 states. [2020-10-05 23:34:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 3979 transitions. [2020-10-05 23:34:23,590 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 3979 transitions. Word has length 18 [2020-10-05 23:34:23,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:23,590 INFO L479 AbstractCegarLoop]: Abstraction has 1391 states and 3979 transitions. [2020-10-05 23:34:23,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:34:23,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 3979 transitions. [2020-10-05 23:34:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:34:23,594 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:23,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:23,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:34:23,595 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1940246851, now seen corresponding path program 1 times [2020-10-05 23:34:23,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:23,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470246835] [2020-10-05 23:34:23,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:23,747 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-05 23:34:23,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470246835] [2020-10-05 23:34:23,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:23,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:34:23,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388623206] [2020-10-05 23:34:23,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:34:23,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:23,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:34:23,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:34:23,752 INFO L87 Difference]: Start difference. First operand 1391 states and 3979 transitions. Second operand 6 states. [2020-10-05 23:34:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:23,820 INFO L93 Difference]: Finished difference Result 1238 states and 3505 transitions. [2020-10-05 23:34:23,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:34:23,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-05 23:34:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:23,824 INFO L225 Difference]: With dead ends: 1238 [2020-10-05 23:34:23,824 INFO L226 Difference]: Without dead ends: 1048 [2020-10-05 23:34:23,825 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:34:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2020-10-05 23:34:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2020-10-05 23:34:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2020-10-05 23:34:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2974 transitions. [2020-10-05 23:34:23,850 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2974 transitions. Word has length 21 [2020-10-05 23:34:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:23,850 INFO L479 AbstractCegarLoop]: Abstraction has 1048 states and 2974 transitions. [2020-10-05 23:34:23,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:34:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2974 transitions. [2020-10-05 23:34:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:34:23,854 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:23,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:23,854 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:34:23,854 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:23,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:23,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1097481977, now seen corresponding path program 1 times [2020-10-05 23:34:23,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:23,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307796936] [2020-10-05 23:34:23,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:23,907 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-05 23:34:23,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307796936] [2020-10-05 23:34:23,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:23,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:34:23,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915463911] [2020-10-05 23:34:23,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:34:23,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:23,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:34:23,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:34:23,909 INFO L87 Difference]: Start difference. First operand 1048 states and 2974 transitions. Second operand 3 states. [2020-10-05 23:34:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:23,924 INFO L93 Difference]: Finished difference Result 1426 states and 3956 transitions. [2020-10-05 23:34:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:34:23,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-05 23:34:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:23,927 INFO L225 Difference]: With dead ends: 1426 [2020-10-05 23:34:23,928 INFO L226 Difference]: Without dead ends: 941 [2020-10-05 23:34:23,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:34:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2020-10-05 23:34:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 938. [2020-10-05 23:34:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2020-10-05 23:34:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 2537 transitions. [2020-10-05 23:34:23,951 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 2537 transitions. Word has length 24 [2020-10-05 23:34:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:23,951 INFO L479 AbstractCegarLoop]: Abstraction has 938 states and 2537 transitions. [2020-10-05 23:34:23,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:34:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 2537 transitions. [2020-10-05 23:34:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:34:23,954 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:23,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:23,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:34:23,955 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:23,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2038002769, now seen corresponding path program 2 times [2020-10-05 23:34:23,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:23,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179601193] [2020-10-05 23:34:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:24,154 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-05 23:34:24,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179601193] [2020-10-05 23:34:24,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:24,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:34:24,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79503174] [2020-10-05 23:34:24,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:34:24,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:24,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:34:24,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:34:24,156 INFO L87 Difference]: Start difference. First operand 938 states and 2537 transitions. Second operand 7 states. [2020-10-05 23:34:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:24,229 INFO L93 Difference]: Finished difference Result 909 states and 2480 transitions. [2020-10-05 23:34:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:34:24,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-05 23:34:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:24,231 INFO L225 Difference]: With dead ends: 909 [2020-10-05 23:34:24,231 INFO L226 Difference]: Without dead ends: 343 [2020-10-05 23:34:24,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:34:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-10-05 23:34:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2020-10-05 23:34:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-10-05 23:34:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 940 transitions. [2020-10-05 23:34:24,240 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 940 transitions. Word has length 24 [2020-10-05 23:34:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:24,240 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 940 transitions. [2020-10-05 23:34:24,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:34:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 940 transitions. [2020-10-05 23:34:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:34:24,242 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:24,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:24,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:34:24,242 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash -377531711, now seen corresponding path program 1 times [2020-10-05 23:34:24,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:24,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155214724] [2020-10-05 23:34:24,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:24,606 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-05 23:34:24,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155214724] [2020-10-05 23:34:24,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:24,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:34:24,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962065181] [2020-10-05 23:34:24,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:34:24,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:24,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:34:24,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:34:24,609 INFO L87 Difference]: Start difference. First operand 343 states and 940 transitions. Second operand 12 states. [2020-10-05 23:34:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:25,415 INFO L93 Difference]: Finished difference Result 465 states and 1230 transitions. [2020-10-05 23:34:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-05 23:34:25,416 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-10-05 23:34:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:25,417 INFO L225 Difference]: With dead ends: 465 [2020-10-05 23:34:25,417 INFO L226 Difference]: Without dead ends: 369 [2020-10-05 23:34:25,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:34:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2020-10-05 23:34:25,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2020-10-05 23:34:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-10-05 23:34:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1005 transitions. [2020-10-05 23:34:25,427 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1005 transitions. Word has length 28 [2020-10-05 23:34:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:25,428 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 1005 transitions. [2020-10-05 23:34:25,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:34:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1005 transitions. [2020-10-05 23:34:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:34:25,429 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:25,429 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:25,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:34:25,430 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:25,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash -161402091, now seen corresponding path program 2 times [2020-10-05 23:34:25,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:25,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841699316] [2020-10-05 23:34:25,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:25,785 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-05 23:34:25,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841699316] [2020-10-05 23:34:25,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:25,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:34:25,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025178772] [2020-10-05 23:34:25,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:34:25,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:25,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:34:25,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:34:25,787 INFO L87 Difference]: Start difference. First operand 369 states and 1005 transitions. Second operand 12 states. [2020-10-05 23:34:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:26,480 INFO L93 Difference]: Finished difference Result 501 states and 1310 transitions. [2020-10-05 23:34:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-05 23:34:26,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-10-05 23:34:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:26,482 INFO L225 Difference]: With dead ends: 501 [2020-10-05 23:34:26,483 INFO L226 Difference]: Without dead ends: 437 [2020-10-05 23:34:26,483 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:34:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-10-05 23:34:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 424. [2020-10-05 23:34:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-05 23:34:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1135 transitions. [2020-10-05 23:34:26,495 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1135 transitions. Word has length 28 [2020-10-05 23:34:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:26,495 INFO L479 AbstractCegarLoop]: Abstraction has 424 states and 1135 transitions. [2020-10-05 23:34:26,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:34:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1135 transitions. [2020-10-05 23:34:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:34:26,497 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:26,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:26,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:34:26,498 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:26,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:26,498 INFO L82 PathProgramCache]: Analyzing trace with hash 784716631, now seen corresponding path program 3 times [2020-10-05 23:34:26,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:26,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906172060] [2020-10-05 23:34:26,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:26,896 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2020-10-05 23:34:27,060 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-05 23:34:27,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906172060] [2020-10-05 23:34:27,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:27,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-05 23:34:27,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958055142] [2020-10-05 23:34:27,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-05 23:34:27,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:27,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-05 23:34:27,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-10-05 23:34:27,062 INFO L87 Difference]: Start difference. First operand 424 states and 1135 transitions. Second operand 13 states. [2020-10-05 23:34:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:27,399 INFO L93 Difference]: Finished difference Result 434 states and 1144 transitions. [2020-10-05 23:34:27,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 23:34:27,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2020-10-05 23:34:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:27,401 INFO L225 Difference]: With dead ends: 434 [2020-10-05 23:34:27,402 INFO L226 Difference]: Without dead ends: 267 [2020-10-05 23:34:27,402 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:34:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-10-05 23:34:27,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2020-10-05 23:34:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2020-10-05 23:34:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 684 transitions. [2020-10-05 23:34:27,409 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 684 transitions. Word has length 28 [2020-10-05 23:34:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:27,409 INFO L479 AbstractCegarLoop]: Abstraction has 267 states and 684 transitions. [2020-10-05 23:34:27,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-05 23:34:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 684 transitions. [2020-10-05 23:34:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:34:27,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:27,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:27,411 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:34:27,411 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:27,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:27,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1722619641, now seen corresponding path program 4 times [2020-10-05 23:34:27,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:27,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336615083] [2020-10-05 23:34:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:27,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336615083] [2020-10-05 23:34:27,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:27,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:34:27,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560026866] [2020-10-05 23:34:27,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:34:27,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:27,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:34:27,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:34:27,775 INFO L87 Difference]: Start difference. First operand 267 states and 684 transitions. Second operand 12 states. [2020-10-05 23:34:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:28,367 INFO L93 Difference]: Finished difference Result 326 states and 826 transitions. [2020-10-05 23:34:28,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 23:34:28,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-10-05 23:34:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:28,368 INFO L225 Difference]: With dead ends: 326 [2020-10-05 23:34:28,368 INFO L226 Difference]: Without dead ends: 294 [2020-10-05 23:34:28,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:34:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-10-05 23:34:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 282. [2020-10-05 23:34:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-05 23:34:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 725 transitions. [2020-10-05 23:34:28,379 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 725 transitions. Word has length 28 [2020-10-05 23:34:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:28,379 INFO L479 AbstractCegarLoop]: Abstraction has 282 states and 725 transitions. [2020-10-05 23:34:28,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:34:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 725 transitions. [2020-10-05 23:34:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:34:28,380 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:28,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:28,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:34:28,381 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:28,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1938749261, now seen corresponding path program 5 times [2020-10-05 23:34:28,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:28,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790565355] [2020-10-05 23:34:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:28,527 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-05 23:34:28,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790565355] [2020-10-05 23:34:28,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:28,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:34:28,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546351506] [2020-10-05 23:34:28,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:34:28,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:34:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:34:28,529 INFO L87 Difference]: Start difference. First operand 282 states and 725 transitions. Second operand 7 states. [2020-10-05 23:34:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:28,733 INFO L93 Difference]: Finished difference Result 305 states and 771 transitions. [2020-10-05 23:34:28,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:34:28,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-10-05 23:34:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:28,735 INFO L225 Difference]: With dead ends: 305 [2020-10-05 23:34:28,735 INFO L226 Difference]: Without dead ends: 294 [2020-10-05 23:34:28,735 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:34:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-10-05 23:34:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 282. [2020-10-05 23:34:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-05 23:34:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 724 transitions. [2020-10-05 23:34:28,743 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 724 transitions. Word has length 28 [2020-10-05 23:34:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:28,743 INFO L479 AbstractCegarLoop]: Abstraction has 282 states and 724 transitions. [2020-10-05 23:34:28,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:34:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 724 transitions. [2020-10-05 23:34:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:34:28,744 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:28,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:28,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:34:28,745 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:28,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1688066953, now seen corresponding path program 6 times [2020-10-05 23:34:28,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:28,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059812353] [2020-10-05 23:34:28,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:29,252 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-05 23:34:29,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059812353] [2020-10-05 23:34:29,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:29,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:34:29,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050235259] [2020-10-05 23:34:29,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:34:29,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:29,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:34:29,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:34:29,255 INFO L87 Difference]: Start difference. First operand 282 states and 724 transitions. Second operand 9 states. [2020-10-05 23:34:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:29,536 INFO L93 Difference]: Finished difference Result 352 states and 864 transitions. [2020-10-05 23:34:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:34:29,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-10-05 23:34:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:29,538 INFO L225 Difference]: With dead ends: 352 [2020-10-05 23:34:29,538 INFO L226 Difference]: Without dead ends: 295 [2020-10-05 23:34:29,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:34:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-10-05 23:34:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2020-10-05 23:34:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-10-05 23:34:29,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 656 transitions. [2020-10-05 23:34:29,546 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 656 transitions. Word has length 28 [2020-10-05 23:34:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:29,546 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 656 transitions. [2020-10-05 23:34:29,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:34:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 656 transitions. [2020-10-05 23:34:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:34:29,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:29,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:29,547 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:34:29,548 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:34:29,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:29,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1526982893, now seen corresponding path program 7 times [2020-10-05 23:34:29,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:29,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597157146] [2020-10-05 23:34:29,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:34:29,605 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:34:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:34:29,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:34:29,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:34:29,717 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:34:29,717 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:34:29,719 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:34:29,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1157] [1157] L2-->L874: Formula: (let ((.cse6 (= (mod ~b$w_buff1_used~0_In-577654321 256) 0)) (.cse7 (= (mod ~b$r_buff1_thd0~0_In-577654321 256) 0)) (.cse8 (= (mod ~b$w_buff0_used~0_In-577654321 256) 0)) (.cse9 (= (mod ~b$r_buff0_thd0~0_In-577654321 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= ~b$r_buff1_thd0~0_Out-577654321 ~b$r_buff1_thd0~0_In-577654321) (= ~b$r_buff0_thd0~0_Out-577654321 ~b$r_buff0_thd0~0_In-577654321) (or (and (= ~b$w_buff0_used~0_Out-577654321 0) .cse0 .cse1) (and .cse2 (= ~b$w_buff0_used~0_In-577654321 ~b$w_buff0_used~0_Out-577654321))) (or (and .cse0 .cse1 (= ~b$w_buff0~0_In-577654321 ~b~0_Out-577654321)) (and .cse2 (or (and .cse3 (= ~b~0_Out-577654321 ~b~0_In-577654321)) (and .cse4 (= ~b~0_Out-577654321 ~b$w_buff1~0_In-577654321) .cse5)))) (or (and (= ~b$w_buff1_used~0_Out-577654321 0) .cse4 .cse5) (and .cse3 (= ~b$w_buff1_used~0_In-577654321 ~b$w_buff1_used~0_Out-577654321))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-577654321 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-577654321 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-577654321|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-577654321, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-577654321|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-577654321, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-577654321, ~b~0=~b~0_In-577654321, ~b$w_buff1~0=~b$w_buff1~0_In-577654321, ~b$w_buff0~0=~b$w_buff0~0_In-577654321, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-577654321} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-577654321, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-577654321|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-577654321|, ULTIMATE.start_main_#t~ite54=|ULTIMATE.start_main_#t~ite54_Out-577654321|, ULTIMATE.start_main_#t~ite53=|ULTIMATE.start_main_#t~ite53_Out-577654321|, ULTIMATE.start_main_#t~ite56=|ULTIMATE.start_main_#t~ite56_Out-577654321|, ULTIMATE.start_main_#t~ite55=|ULTIMATE.start_main_#t~ite55_Out-577654321|, ~b$w_buff0_used~0=~b$w_buff0_used~0_Out-577654321, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-577654321|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-577654321, ~b$w_buff1_used~0=~b$w_buff1_used~0_Out-577654321, ~b~0=~b~0_Out-577654321, ~b$w_buff1~0=~b$w_buff1~0_In-577654321, ~b$w_buff0~0=~b$w_buff0~0_In-577654321, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_Out-577654321} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~b$w_buff1_used~0, ~b~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~b$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2020-10-05 23:34:29,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:29,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,772 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:29,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,773 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:29,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,773 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:29,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,774 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-05 23:34:29,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,774 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-05 23:34:29,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,775 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-05 23:34:29,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,776 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-05 23:34:29,776 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,776 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-05 23:34:29,776 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,776 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-05 23:34:29,776 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,777 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-05 23:34:29,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,777 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-05 23:34:29,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,777 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-05 23:34:29,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,778 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-05 23:34:29,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,778 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-05 23:34:29,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,778 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-05 23:34:29,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,779 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-05 23:34:29,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,779 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-05 23:34:29,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,779 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-05 23:34:29,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,780 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-05 23:34:29,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,780 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-05 23:34:29,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,781 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-05 23:34:29,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,781 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-05 23:34:29,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,781 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-05 23:34:29,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,781 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-05 23:34:29,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,782 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-05 23:34:29,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,782 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-05 23:34:29,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,783 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-05 23:34:29,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,783 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-05 23:34:29,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,784 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-05 23:34:29,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,784 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-05 23:34:29,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,784 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-05 23:34:29,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,785 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-05 23:34:29,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:29,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:34:29 BasicIcfg [2020-10-05 23:34:29,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:34:29,858 INFO L168 Benchmark]: Toolchain (without parser) took 15561.08 ms. Allocated memory was 138.4 MB in the beginning and 475.5 MB in the end (delta: 337.1 MB). Free memory was 99.6 MB in the beginning and 302.1 MB in the end (delta: -202.4 MB). Peak memory consumption was 134.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:34:29,859 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:34:29,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 897.77 ms. Allocated memory was 138.4 MB in the beginning and 204.5 MB in the end (delta: 66.1 MB). Free memory was 99.2 MB in the beginning and 154.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:34:29,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.51 ms. Allocated memory is still 204.5 MB. Free memory was 154.5 MB in the beginning and 151.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:34:29,860 INFO L168 Benchmark]: Boogie Preprocessor took 66.50 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:34:29,861 INFO L168 Benchmark]: RCFGBuilder took 2302.36 ms. Allocated memory was 204.5 MB in the beginning and 248.5 MB in the end (delta: 44.0 MB). Free memory was 148.9 MB in the beginning and 141.5 MB in the end (delta: 7.4 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:34:29,862 INFO L168 Benchmark]: TraceAbstraction took 12223.64 ms. Allocated memory was 248.5 MB in the beginning and 475.5 MB in the end (delta: 227.0 MB). Free memory was 141.5 MB in the beginning and 302.1 MB in the end (delta: -160.6 MB). Peak memory consumption was 66.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:34:29,866 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 897.77 ms. Allocated memory was 138.4 MB in the beginning and 204.5 MB in the end (delta: 66.1 MB). Free memory was 99.2 MB in the beginning and 154.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.51 ms. Allocated memory is still 204.5 MB. Free memory was 154.5 MB in the beginning and 151.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.50 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2302.36 ms. Allocated memory was 204.5 MB in the beginning and 248.5 MB in the end (delta: 44.0 MB). Free memory was 148.9 MB in the beginning and 141.5 MB in the end (delta: 7.4 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12223.64 ms. Allocated memory was 248.5 MB in the beginning and 475.5 MB in the end (delta: 227.0 MB). Free memory was 141.5 MB in the beginning and 302.1 MB in the end (delta: -160.6 MB). Peak memory consumption was 66.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 124 ProgramPointsBefore, 47 ProgramPointsAfterwards, 113 TransitionsBefore, 34 TransitionsAfterwards, 2814 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 1337 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 7711 CheckedPairsTotal, 85 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L707] 0 int b = 0; [L708] 0 _Bool b$flush_delayed; [L709] 0 int b$mem_tmp; [L710] 0 _Bool b$r_buff0_thd0; [L711] 0 _Bool b$r_buff0_thd1; [L712] 0 _Bool b$r_buff0_thd2; [L713] 0 _Bool b$r_buff0_thd3; [L714] 0 _Bool b$r_buff0_thd4; [L715] 0 _Bool b$r_buff1_thd0; [L716] 0 _Bool b$r_buff1_thd1; [L717] 0 _Bool b$r_buff1_thd2; [L718] 0 _Bool b$r_buff1_thd3; [L719] 0 _Bool b$r_buff1_thd4; [L720] 0 _Bool b$read_delayed; [L721] 0 int *b$read_delayed_var; [L722] 0 int b$w_buff0; [L723] 0 _Bool b$w_buff0_used; [L724] 0 int b$w_buff1; [L725] 0 _Bool b$w_buff1_used; [L726] 0 _Bool main$tmp_guard0; [L727] 0 _Bool main$tmp_guard1; [L729] 0 int x = 0; [L731] 0 int y = 0; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1257; [L857] FCALL, FORK 0 pthread_create(&t1257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] 0 pthread_t t1258; [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L744] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L745] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L746] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L747] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L748] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L749] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] FCALL, FORK 0 pthread_create(&t1258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L860] 0 pthread_t t1259; [L861] FCALL, FORK 0 pthread_create(&t1259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t1260; [L863] FCALL, FORK 0 pthread_create(&t1260, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L775] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L775] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L776] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L776] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L777] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L777] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L778] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L778] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L779] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L779] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L789] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L792] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L809] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L812] 4 a = 1 [L815] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L818] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 4 b$flush_delayed = weak$$choice2 [L821] 4 b$mem_tmp = b [L822] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L822] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L823] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L823] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L823] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0 [L823] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L823] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L823] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L824] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L824] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L825] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L825] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L826] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L826] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L827] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L828] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 __unbuffered_p3_EBX = b [L830] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L830] 4 b = b$flush_delayed ? b$mem_tmp : b [L831] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2] [L755] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L755] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L756] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L757] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L757] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L758] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L758] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L759] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L759] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L834] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L834] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L834] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L834] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L835] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L835] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L836] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L836] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L837] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L837] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L838] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L838] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L795] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L795] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L795] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L795] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L796] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L796] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L797] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L797] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L798] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L798] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L799] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L799] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L802] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 3 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L876] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 687 SDtfs, 723 SDslu, 2163 SDs, 0 SdLazy, 1824 SolverSat, 255 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4874occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 550 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 81124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...