/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:16:19,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:16:19,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:16:19,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:16:19,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:16:19,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:16:19,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:16:19,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:16:19,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:16:19,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:16:19,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:16:19,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:16:19,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:16:19,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:16:19,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:16:19,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:16:19,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:16:19,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:16:19,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:16:19,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:16:19,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:16:19,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:16:19,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:16:19,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:16:19,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:16:19,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:16:19,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:16:19,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:16:19,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:16:19,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:16:19,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:16:19,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:16:19,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:16:19,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:16:19,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:16:19,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:16:19,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:16:19,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:16:19,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:16:19,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:16:19,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:16:19,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:16:19,851 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:16:19,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:16:19,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:16:19,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:16:19,853 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:16:19,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:16:19,853 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:16:19,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:16:19,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:16:19,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:16:19,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:16:19,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:16:19,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:16:19,855 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:16:19,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:16:19,855 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:16:19,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:16:19,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:16:19,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:16:19,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:16:19,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:16:19,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:16:19,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:16:19,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:16:19,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:16:19,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:16:19,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:16:19,858 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:16:19,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:16:19,858 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:16:20,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:16:20,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:16:20,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:16:20,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:16:20,196 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:16:20,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i [2019-12-27 06:16:20,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e52ce8294/4079e8374de24fdea135787c5fe4f63c/FLAG2a9f42d21 [2019-12-27 06:16:20,855 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:16:20,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i [2019-12-27 06:16:20,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e52ce8294/4079e8374de24fdea135787c5fe4f63c/FLAG2a9f42d21 [2019-12-27 06:16:21,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e52ce8294/4079e8374de24fdea135787c5fe4f63c [2019-12-27 06:16:21,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:16:21,140 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:16:21,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:16:21,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:16:21,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:16:21,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:16:21" (1/1) ... [2019-12-27 06:16:21,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21, skipping insertion in model container [2019-12-27 06:16:21,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:16:21" (1/1) ... [2019-12-27 06:16:21,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:16:21,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:16:21,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:16:21,749 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:16:21,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:16:21,915 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:16:21,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21 WrapperNode [2019-12-27 06:16:21,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:16:21,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:16:21,916 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:16:21,916 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:16:21,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21" (1/1) ... [2019-12-27 06:16:21,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21" (1/1) ... [2019-12-27 06:16:21,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:16:21,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:16:21,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:16:21,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:16:22,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21" (1/1) ... [2019-12-27 06:16:22,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21" (1/1) ... [2019-12-27 06:16:22,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21" (1/1) ... [2019-12-27 06:16:22,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21" (1/1) ... [2019-12-27 06:16:22,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21" (1/1) ... [2019-12-27 06:16:22,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21" (1/1) ... [2019-12-27 06:16:22,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21" (1/1) ... [2019-12-27 06:16:22,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:16:22,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:16:22,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:16:22,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:16:22,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21" (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 [2019-12-27 06:16:22,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:16:22,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:16:22,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:16:22,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:16:22,121 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:16:22,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:16:22,121 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:16:22,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:16:22,122 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:16:22,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:16:22,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:16:22,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:16:22,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:16:22,125 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:16:22,962 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:16:22,963 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:16:22,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:16:22 BoogieIcfgContainer [2019-12-27 06:16:22,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:16:22,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:16:22,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:16:22,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:16:22,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:16:21" (1/3) ... [2019-12-27 06:16:22,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e48b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:16:22, skipping insertion in model container [2019-12-27 06:16:22,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:21" (2/3) ... [2019-12-27 06:16:22,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e48b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:16:22, skipping insertion in model container [2019-12-27 06:16:22,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:16:22" (3/3) ... [2019-12-27 06:16:22,975 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_power.oepc.i [2019-12-27 06:16:22,983 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:16:22,983 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:16:22,991 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:16:22,991 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:16:23,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,035 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,035 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,035 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,039 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,039 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,064 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,065 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,072 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,073 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,101 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,103 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,110 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,117 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,117 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:23,137 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:16:23,157 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:16:23,157 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:16:23,157 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:16:23,157 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:16:23,158 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:16:23,158 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:16:23,158 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:16:23,158 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:16:23,183 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 06:16:23,185 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 06:16:23,301 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 06:16:23,302 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:16:23,318 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:16:23,343 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 06:16:23,400 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 06:16:23,400 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:16:23,408 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:16:23,431 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:16:23,433 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:16:27,053 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 06:16:27,240 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 06:16:27,265 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86659 [2019-12-27 06:16:27,265 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 06:16:27,269 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-27 06:16:47,012 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-27 06:16:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-27 06:16:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:16:47,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:47,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:16:47,021 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:47,026 INFO L82 PathProgramCache]: Analyzing trace with hash 916959, now seen corresponding path program 1 times [2019-12-27 06:16:47,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:47,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806926109] [2019-12-27 06:16:47,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:16:47,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806926109] [2019-12-27 06:16:47,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:47,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:16:47,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377963290] [2019-12-27 06:16:47,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:16:47,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:47,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:16:47,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:16:47,313 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-27 06:16:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:48,628 INFO L93 Difference]: Finished difference Result 123002 states and 528862 transitions. [2019-12-27 06:16:48,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:16:48,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:16:48,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:49,339 INFO L225 Difference]: With dead ends: 123002 [2019-12-27 06:16:49,339 INFO L226 Difference]: Without dead ends: 115358 [2019-12-27 06:16:49,347 INFO L631 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 [2019-12-27 06:16:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115358 states. [2019-12-27 06:17:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115358 to 115358. [2019-12-27 06:17:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115358 states. [2019-12-27 06:17:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115358 states to 115358 states and 495332 transitions. [2019-12-27 06:17:00,824 INFO L78 Accepts]: Start accepts. Automaton has 115358 states and 495332 transitions. Word has length 3 [2019-12-27 06:17:00,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:00,825 INFO L462 AbstractCegarLoop]: Abstraction has 115358 states and 495332 transitions. [2019-12-27 06:17:00,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 115358 states and 495332 transitions. [2019-12-27 06:17:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:17:00,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:00,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:00,830 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:00,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:00,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1587788746, now seen corresponding path program 1 times [2019-12-27 06:17:00,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:00,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497115341] [2019-12-27 06:17:00,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:00,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497115341] [2019-12-27 06:17:00,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:00,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:00,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915644597] [2019-12-27 06:17:00,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:00,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:00,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:00,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:00,942 INFO L87 Difference]: Start difference. First operand 115358 states and 495332 transitions. Second operand 4 states. [2019-12-27 06:17:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:06,390 INFO L93 Difference]: Finished difference Result 179368 states and 739568 transitions. [2019-12-27 06:17:06,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:06,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:17:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:07,177 INFO L225 Difference]: With dead ends: 179368 [2019-12-27 06:17:07,177 INFO L226 Difference]: Without dead ends: 179319 [2019-12-27 06:17:07,178 INFO L631 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 [2019-12-27 06:17:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179319 states. [2019-12-27 06:17:20,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179319 to 163842. [2019-12-27 06:17:20,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163842 states. [2019-12-27 06:17:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163842 states to 163842 states and 684578 transitions. [2019-12-27 06:17:22,071 INFO L78 Accepts]: Start accepts. Automaton has 163842 states and 684578 transitions. Word has length 11 [2019-12-27 06:17:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:22,071 INFO L462 AbstractCegarLoop]: Abstraction has 163842 states and 684578 transitions. [2019-12-27 06:17:22,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 163842 states and 684578 transitions. [2019-12-27 06:17:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:17:22,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:22,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:22,079 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:22,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:22,079 INFO L82 PathProgramCache]: Analyzing trace with hash 245340836, now seen corresponding path program 1 times [2019-12-27 06:17:22,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:22,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774262155] [2019-12-27 06:17:22,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:22,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774262155] [2019-12-27 06:17:22,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:22,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:22,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949695881] [2019-12-27 06:17:22,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:22,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:22,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:22,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:22,136 INFO L87 Difference]: Start difference. First operand 163842 states and 684578 transitions. Second operand 3 states. [2019-12-27 06:17:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:22,277 INFO L93 Difference]: Finished difference Result 35474 states and 116324 transitions. [2019-12-27 06:17:22,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:22,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:17:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:22,348 INFO L225 Difference]: With dead ends: 35474 [2019-12-27 06:17:22,348 INFO L226 Difference]: Without dead ends: 35474 [2019-12-27 06:17:22,349 INFO L631 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 [2019-12-27 06:17:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2019-12-27 06:17:22,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 35474. [2019-12-27 06:17:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35474 states. [2019-12-27 06:17:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35474 states to 35474 states and 116324 transitions. [2019-12-27 06:17:23,046 INFO L78 Accepts]: Start accepts. Automaton has 35474 states and 116324 transitions. Word has length 13 [2019-12-27 06:17:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:23,047 INFO L462 AbstractCegarLoop]: Abstraction has 35474 states and 116324 transitions. [2019-12-27 06:17:23,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 35474 states and 116324 transitions. [2019-12-27 06:17:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:17:23,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:23,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:23,051 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:23,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:23,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1764199357, now seen corresponding path program 1 times [2019-12-27 06:17:23,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:23,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459197592] [2019-12-27 06:17:23,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:23,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459197592] [2019-12-27 06:17:23,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:23,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:23,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204578003] [2019-12-27 06:17:23,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:23,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:23,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:23,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:23,118 INFO L87 Difference]: Start difference. First operand 35474 states and 116324 transitions. Second operand 3 states. [2019-12-27 06:17:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:23,326 INFO L93 Difference]: Finished difference Result 53873 states and 176061 transitions. [2019-12-27 06:17:23,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:23,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 06:17:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:23,416 INFO L225 Difference]: With dead ends: 53873 [2019-12-27 06:17:23,416 INFO L226 Difference]: Without dead ends: 53873 [2019-12-27 06:17:23,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:23,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53873 states. [2019-12-27 06:17:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53873 to 40386. [2019-12-27 06:17:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40386 states. [2019-12-27 06:17:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40386 states to 40386 states and 133919 transitions. [2019-12-27 06:17:26,948 INFO L78 Accepts]: Start accepts. Automaton has 40386 states and 133919 transitions. Word has length 16 [2019-12-27 06:17:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:26,949 INFO L462 AbstractCegarLoop]: Abstraction has 40386 states and 133919 transitions. [2019-12-27 06:17:26,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 40386 states and 133919 transitions. [2019-12-27 06:17:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:17:26,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:26,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:26,952 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:26,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:26,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1679414171, now seen corresponding path program 1 times [2019-12-27 06:17:26,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:26,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893969792] [2019-12-27 06:17:26,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:27,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893969792] [2019-12-27 06:17:27,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:27,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:27,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435288476] [2019-12-27 06:17:27,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:27,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:27,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:27,020 INFO L87 Difference]: Start difference. First operand 40386 states and 133919 transitions. Second operand 4 states. [2019-12-27 06:17:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:27,434 INFO L93 Difference]: Finished difference Result 48153 states and 157153 transitions. [2019-12-27 06:17:27,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:27,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:17:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:27,517 INFO L225 Difference]: With dead ends: 48153 [2019-12-27 06:17:27,518 INFO L226 Difference]: Without dead ends: 48153 [2019-12-27 06:17:27,518 INFO L631 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 [2019-12-27 06:17:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48153 states. [2019-12-27 06:17:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48153 to 44290. [2019-12-27 06:17:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44290 states. [2019-12-27 06:17:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44290 states to 44290 states and 145673 transitions. [2019-12-27 06:17:28,381 INFO L78 Accepts]: Start accepts. Automaton has 44290 states and 145673 transitions. Word has length 16 [2019-12-27 06:17:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:28,381 INFO L462 AbstractCegarLoop]: Abstraction has 44290 states and 145673 transitions. [2019-12-27 06:17:28,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 44290 states and 145673 transitions. [2019-12-27 06:17:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:17:28,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:28,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:28,386 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:28,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1745863415, now seen corresponding path program 1 times [2019-12-27 06:17:28,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:28,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363471242] [2019-12-27 06:17:28,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:28,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363471242] [2019-12-27 06:17:28,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:28,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:28,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118622840] [2019-12-27 06:17:28,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:28,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:28,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:28,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:28,446 INFO L87 Difference]: Start difference. First operand 44290 states and 145673 transitions. Second operand 4 states. [2019-12-27 06:17:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:28,837 INFO L93 Difference]: Finished difference Result 52593 states and 171527 transitions. [2019-12-27 06:17:28,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:28,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:17:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:28,931 INFO L225 Difference]: With dead ends: 52593 [2019-12-27 06:17:28,932 INFO L226 Difference]: Without dead ends: 52593 [2019-12-27 06:17:28,932 INFO L631 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 [2019-12-27 06:17:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52593 states. [2019-12-27 06:17:30,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52593 to 45862. [2019-12-27 06:17:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-12-27 06:17:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 150892 transitions. [2019-12-27 06:17:30,290 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 150892 transitions. Word has length 16 [2019-12-27 06:17:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:30,290 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 150892 transitions. [2019-12-27 06:17:30,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 150892 transitions. [2019-12-27 06:17:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:17:30,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:30,301 INFO L411 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] [2019-12-27 06:17:30,301 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:30,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:30,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1921236917, now seen corresponding path program 1 times [2019-12-27 06:17:30,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:30,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857705070] [2019-12-27 06:17:30,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:30,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857705070] [2019-12-27 06:17:30,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:30,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:30,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796576168] [2019-12-27 06:17:30,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:30,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:30,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:30,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:30,429 INFO L87 Difference]: Start difference. First operand 45862 states and 150892 transitions. Second operand 5 states. [2019-12-27 06:17:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:31,163 INFO L93 Difference]: Finished difference Result 62673 states and 200938 transitions. [2019-12-27 06:17:31,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:17:31,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:17:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:31,282 INFO L225 Difference]: With dead ends: 62673 [2019-12-27 06:17:31,282 INFO L226 Difference]: Without dead ends: 62666 [2019-12-27 06:17:31,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62666 states. [2019-12-27 06:17:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62666 to 47202. [2019-12-27 06:17:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47202 states. [2019-12-27 06:17:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47202 states to 47202 states and 154985 transitions. [2019-12-27 06:17:32,228 INFO L78 Accepts]: Start accepts. Automaton has 47202 states and 154985 transitions. Word has length 22 [2019-12-27 06:17:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:32,228 INFO L462 AbstractCegarLoop]: Abstraction has 47202 states and 154985 transitions. [2019-12-27 06:17:32,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 47202 states and 154985 transitions. [2019-12-27 06:17:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:17:32,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:32,238 INFO L411 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] [2019-12-27 06:17:32,238 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1854787673, now seen corresponding path program 1 times [2019-12-27 06:17:32,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:32,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489359258] [2019-12-27 06:17:32,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:32,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489359258] [2019-12-27 06:17:32,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:32,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:32,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273952946] [2019-12-27 06:17:32,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:32,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:32,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:32,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:32,322 INFO L87 Difference]: Start difference. First operand 47202 states and 154985 transitions. Second operand 5 states. [2019-12-27 06:17:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:32,949 INFO L93 Difference]: Finished difference Result 65940 states and 210721 transitions. [2019-12-27 06:17:32,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:17:32,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:17:32,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:33,056 INFO L225 Difference]: With dead ends: 65940 [2019-12-27 06:17:33,057 INFO L226 Difference]: Without dead ends: 65933 [2019-12-27 06:17:33,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65933 states. [2019-12-27 06:17:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65933 to 45465. [2019-12-27 06:17:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45465 states. [2019-12-27 06:17:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45465 states to 45465 states and 149394 transitions. [2019-12-27 06:17:34,384 INFO L78 Accepts]: Start accepts. Automaton has 45465 states and 149394 transitions. Word has length 22 [2019-12-27 06:17:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:34,384 INFO L462 AbstractCegarLoop]: Abstraction has 45465 states and 149394 transitions. [2019-12-27 06:17:34,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 45465 states and 149394 transitions. [2019-12-27 06:17:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:17:34,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:34,396 INFO L411 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] [2019-12-27 06:17:34,396 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:34,397 INFO L82 PathProgramCache]: Analyzing trace with hash 145172187, now seen corresponding path program 1 times [2019-12-27 06:17:34,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:34,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829577504] [2019-12-27 06:17:34,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:34,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829577504] [2019-12-27 06:17:34,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:34,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:34,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726049645] [2019-12-27 06:17:34,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:34,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:34,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:34,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:34,447 INFO L87 Difference]: Start difference. First operand 45465 states and 149394 transitions. Second operand 4 states. [2019-12-27 06:17:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:34,529 INFO L93 Difference]: Finished difference Result 18727 states and 58359 transitions. [2019-12-27 06:17:34,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:17:34,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:17:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:34,557 INFO L225 Difference]: With dead ends: 18727 [2019-12-27 06:17:34,558 INFO L226 Difference]: Without dead ends: 18727 [2019-12-27 06:17:34,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18727 states. [2019-12-27 06:17:34,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18727 to 18364. [2019-12-27 06:17:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-12-27 06:17:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 57323 transitions. [2019-12-27 06:17:34,841 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 57323 transitions. Word has length 25 [2019-12-27 06:17:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:34,842 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 57323 transitions. [2019-12-27 06:17:34,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 57323 transitions. [2019-12-27 06:17:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:17:34,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:34,856 INFO L411 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] [2019-12-27 06:17:34,856 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:34,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2016642455, now seen corresponding path program 1 times [2019-12-27 06:17:34,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:34,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281357761] [2019-12-27 06:17:34,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:34,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281357761] [2019-12-27 06:17:34,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:34,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:34,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605999757] [2019-12-27 06:17:34,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:34,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:34,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:34,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:34,898 INFO L87 Difference]: Start difference. First operand 18364 states and 57323 transitions. Second operand 3 states. [2019-12-27 06:17:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:34,995 INFO L93 Difference]: Finished difference Result 24105 states and 71434 transitions. [2019-12-27 06:17:34,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:34,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:17:34,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:35,027 INFO L225 Difference]: With dead ends: 24105 [2019-12-27 06:17:35,027 INFO L226 Difference]: Without dead ends: 24105 [2019-12-27 06:17:35,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:35,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24105 states. [2019-12-27 06:17:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24105 to 18364. [2019-12-27 06:17:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-12-27 06:17:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 54802 transitions. [2019-12-27 06:17:35,338 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 54802 transitions. Word has length 27 [2019-12-27 06:17:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:35,338 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 54802 transitions. [2019-12-27 06:17:35,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 54802 transitions. [2019-12-27 06:17:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:17:35,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:35,351 INFO L411 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] [2019-12-27 06:17:35,351 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:35,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:35,352 INFO L82 PathProgramCache]: Analyzing trace with hash -364349975, now seen corresponding path program 1 times [2019-12-27 06:17:35,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:35,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929066424] [2019-12-27 06:17:35,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:35,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929066424] [2019-12-27 06:17:35,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:35,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:35,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358150151] [2019-12-27 06:17:35,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:35,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:35,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:35,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:35,440 INFO L87 Difference]: Start difference. First operand 18364 states and 54802 transitions. Second operand 5 states. [2019-12-27 06:17:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:35,796 INFO L93 Difference]: Finished difference Result 22570 states and 66509 transitions. [2019-12-27 06:17:35,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:17:35,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 06:17:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:35,843 INFO L225 Difference]: With dead ends: 22570 [2019-12-27 06:17:35,843 INFO L226 Difference]: Without dead ends: 22570 [2019-12-27 06:17:35,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22570 states. [2019-12-27 06:17:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22570 to 21200. [2019-12-27 06:17:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21200 states. [2019-12-27 06:17:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21200 states to 21200 states and 63046 transitions. [2019-12-27 06:17:36,486 INFO L78 Accepts]: Start accepts. Automaton has 21200 states and 63046 transitions. Word has length 27 [2019-12-27 06:17:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:36,486 INFO L462 AbstractCegarLoop]: Abstraction has 21200 states and 63046 transitions. [2019-12-27 06:17:36,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 21200 states and 63046 transitions. [2019-12-27 06:17:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:17:36,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:36,501 INFO L411 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] [2019-12-27 06:17:36,501 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:36,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash 587647727, now seen corresponding path program 1 times [2019-12-27 06:17:36,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:36,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039870401] [2019-12-27 06:17:36,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:36,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039870401] [2019-12-27 06:17:36,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:36,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:36,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491739610] [2019-12-27 06:17:36,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:36,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:36,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:36,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:36,567 INFO L87 Difference]: Start difference. First operand 21200 states and 63046 transitions. Second operand 5 states. [2019-12-27 06:17:36,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:36,956 INFO L93 Difference]: Finished difference Result 24672 states and 72522 transitions. [2019-12-27 06:17:36,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:17:36,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 06:17:36,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:36,992 INFO L225 Difference]: With dead ends: 24672 [2019-12-27 06:17:36,992 INFO L226 Difference]: Without dead ends: 24672 [2019-12-27 06:17:36,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:37,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24672 states. [2019-12-27 06:17:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24672 to 21106. [2019-12-27 06:17:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21106 states. [2019-12-27 06:17:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21106 states to 21106 states and 62614 transitions. [2019-12-27 06:17:37,337 INFO L78 Accepts]: Start accepts. Automaton has 21106 states and 62614 transitions. Word has length 28 [2019-12-27 06:17:37,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:37,337 INFO L462 AbstractCegarLoop]: Abstraction has 21106 states and 62614 transitions. [2019-12-27 06:17:37,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 21106 states and 62614 transitions. [2019-12-27 06:17:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:17:37,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:37,358 INFO L411 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, 1, 1, 1, 1, 1] [2019-12-27 06:17:37,359 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:37,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:37,359 INFO L82 PathProgramCache]: Analyzing trace with hash 688173209, now seen corresponding path program 1 times [2019-12-27 06:17:37,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:37,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865763291] [2019-12-27 06:17:37,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:37,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865763291] [2019-12-27 06:17:37,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:37,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:17:37,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630857687] [2019-12-27 06:17:37,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:17:37,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:37,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:17:37,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:17:37,462 INFO L87 Difference]: Start difference. First operand 21106 states and 62614 transitions. Second operand 6 states. [2019-12-27 06:17:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:38,211 INFO L93 Difference]: Finished difference Result 28374 states and 82992 transitions. [2019-12-27 06:17:38,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:38,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 06:17:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:38,264 INFO L225 Difference]: With dead ends: 28374 [2019-12-27 06:17:38,264 INFO L226 Difference]: Without dead ends: 28374 [2019-12-27 06:17:38,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:17:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28374 states. [2019-12-27 06:17:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28374 to 22550. [2019-12-27 06:17:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22550 states. [2019-12-27 06:17:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22550 states to 22550 states and 66975 transitions. [2019-12-27 06:17:38,660 INFO L78 Accepts]: Start accepts. Automaton has 22550 states and 66975 transitions. Word has length 33 [2019-12-27 06:17:38,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:38,661 INFO L462 AbstractCegarLoop]: Abstraction has 22550 states and 66975 transitions. [2019-12-27 06:17:38,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:17:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 22550 states and 66975 transitions. [2019-12-27 06:17:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:17:38,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:38,681 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:38,681 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:38,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:38,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1143871937, now seen corresponding path program 1 times [2019-12-27 06:17:38,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:38,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010209456] [2019-12-27 06:17:38,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:38,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010209456] [2019-12-27 06:17:38,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:38,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:17:38,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196927832] [2019-12-27 06:17:38,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:17:38,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:38,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:17:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:17:38,763 INFO L87 Difference]: Start difference. First operand 22550 states and 66975 transitions. Second operand 6 states. [2019-12-27 06:17:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:39,487 INFO L93 Difference]: Finished difference Result 27535 states and 80686 transitions. [2019-12-27 06:17:39,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:39,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 06:17:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:39,540 INFO L225 Difference]: With dead ends: 27535 [2019-12-27 06:17:39,540 INFO L226 Difference]: Without dead ends: 27535 [2019-12-27 06:17:39,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:17:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27535 states. [2019-12-27 06:17:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27535 to 19269. [2019-12-27 06:17:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19269 states. [2019-12-27 06:17:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19269 states to 19269 states and 57413 transitions. [2019-12-27 06:17:39,919 INFO L78 Accepts]: Start accepts. Automaton has 19269 states and 57413 transitions. Word has length 34 [2019-12-27 06:17:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:39,919 INFO L462 AbstractCegarLoop]: Abstraction has 19269 states and 57413 transitions. [2019-12-27 06:17:39,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:17:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 19269 states and 57413 transitions. [2019-12-27 06:17:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:17:39,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:39,938 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:39,939 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:39,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:39,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1024843726, now seen corresponding path program 1 times [2019-12-27 06:17:39,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:39,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022158222] [2019-12-27 06:17:39,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:39,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022158222] [2019-12-27 06:17:40,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:40,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:17:40,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154589577] [2019-12-27 06:17:40,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:40,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:40,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:40,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:40,001 INFO L87 Difference]: Start difference. First operand 19269 states and 57413 transitions. Second operand 3 states. [2019-12-27 06:17:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:40,079 INFO L93 Difference]: Finished difference Result 19268 states and 57411 transitions. [2019-12-27 06:17:40,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:40,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:17:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:40,116 INFO L225 Difference]: With dead ends: 19268 [2019-12-27 06:17:40,116 INFO L226 Difference]: Without dead ends: 19268 [2019-12-27 06:17:40,116 INFO L631 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 [2019-12-27 06:17:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-12-27 06:17:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 19268. [2019-12-27 06:17:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19268 states. [2019-12-27 06:17:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19268 states to 19268 states and 57411 transitions. [2019-12-27 06:17:40,545 INFO L78 Accepts]: Start accepts. Automaton has 19268 states and 57411 transitions. Word has length 39 [2019-12-27 06:17:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:40,545 INFO L462 AbstractCegarLoop]: Abstraction has 19268 states and 57411 transitions. [2019-12-27 06:17:40,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 19268 states and 57411 transitions. [2019-12-27 06:17:40,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:17:40,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:40,568 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:40,568 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:40,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1293195895, now seen corresponding path program 1 times [2019-12-27 06:17:40,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:40,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304713981] [2019-12-27 06:17:40,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:40,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304713981] [2019-12-27 06:17:40,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:40,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:40,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135550915] [2019-12-27 06:17:40,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:40,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:40,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:40,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:40,717 INFO L87 Difference]: Start difference. First operand 19268 states and 57411 transitions. Second operand 3 states. [2019-12-27 06:17:40,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:40,819 INFO L93 Difference]: Finished difference Result 19268 states and 57334 transitions. [2019-12-27 06:17:40,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:40,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 06:17:40,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:40,867 INFO L225 Difference]: With dead ends: 19268 [2019-12-27 06:17:40,868 INFO L226 Difference]: Without dead ends: 19268 [2019-12-27 06:17:40,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-12-27 06:17:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 17219. [2019-12-27 06:17:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17219 states. [2019-12-27 06:17:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17219 states to 17219 states and 51708 transitions. [2019-12-27 06:17:41,351 INFO L78 Accepts]: Start accepts. Automaton has 17219 states and 51708 transitions. Word has length 40 [2019-12-27 06:17:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:41,351 INFO L462 AbstractCegarLoop]: Abstraction has 17219 states and 51708 transitions. [2019-12-27 06:17:41,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 17219 states and 51708 transitions. [2019-12-27 06:17:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 06:17:41,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:41,374 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:41,374 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:41,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:41,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1998295176, now seen corresponding path program 1 times [2019-12-27 06:17:41,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:41,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711709300] [2019-12-27 06:17:41,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:41,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711709300] [2019-12-27 06:17:41,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:41,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:17:41,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307657464] [2019-12-27 06:17:41,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:41,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:41,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:41,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:41,443 INFO L87 Difference]: Start difference. First operand 17219 states and 51708 transitions. Second operand 5 states. [2019-12-27 06:17:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:41,527 INFO L93 Difference]: Finished difference Result 16023 states and 49133 transitions. [2019-12-27 06:17:41,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:41,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 06:17:41,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:41,558 INFO L225 Difference]: With dead ends: 16023 [2019-12-27 06:17:41,558 INFO L226 Difference]: Without dead ends: 16023 [2019-12-27 06:17:41,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16023 states. [2019-12-27 06:17:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16023 to 16023. [2019-12-27 06:17:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16023 states. [2019-12-27 06:17:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16023 states to 16023 states and 49133 transitions. [2019-12-27 06:17:41,844 INFO L78 Accepts]: Start accepts. Automaton has 16023 states and 49133 transitions. Word has length 41 [2019-12-27 06:17:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:41,845 INFO L462 AbstractCegarLoop]: Abstraction has 16023 states and 49133 transitions. [2019-12-27 06:17:41,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 16023 states and 49133 transitions. [2019-12-27 06:17:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:17:41,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:41,867 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:41,868 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:41,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1498292074, now seen corresponding path program 1 times [2019-12-27 06:17:41,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:41,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271695574] [2019-12-27 06:17:41,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:41,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271695574] [2019-12-27 06:17:41,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:41,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:41,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411857319] [2019-12-27 06:17:41,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:41,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:41,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:41,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:41,961 INFO L87 Difference]: Start difference. First operand 16023 states and 49133 transitions. Second operand 7 states. [2019-12-27 06:17:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:42,454 INFO L93 Difference]: Finished difference Result 44825 states and 136460 transitions. [2019-12-27 06:17:42,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:42,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:17:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:42,504 INFO L225 Difference]: With dead ends: 44825 [2019-12-27 06:17:42,504 INFO L226 Difference]: Without dead ends: 34913 [2019-12-27 06:17:42,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:17:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34913 states. [2019-12-27 06:17:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34913 to 19456. [2019-12-27 06:17:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19456 states. [2019-12-27 06:17:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19456 states to 19456 states and 59789 transitions. [2019-12-27 06:17:42,944 INFO L78 Accepts]: Start accepts. Automaton has 19456 states and 59789 transitions. Word has length 65 [2019-12-27 06:17:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:42,945 INFO L462 AbstractCegarLoop]: Abstraction has 19456 states and 59789 transitions. [2019-12-27 06:17:42,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 19456 states and 59789 transitions. [2019-12-27 06:17:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:17:42,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:42,963 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:42,963 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:42,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:42,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1514990150, now seen corresponding path program 2 times [2019-12-27 06:17:42,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:42,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156765739] [2019-12-27 06:17:42,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:43,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156765739] [2019-12-27 06:17:43,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:43,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:43,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399776043] [2019-12-27 06:17:43,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:43,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:43,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:43,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:43,074 INFO L87 Difference]: Start difference. First operand 19456 states and 59789 transitions. Second operand 7 states. [2019-12-27 06:17:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:43,596 INFO L93 Difference]: Finished difference Result 51791 states and 156015 transitions. [2019-12-27 06:17:43,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:43,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:17:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:43,647 INFO L225 Difference]: With dead ends: 51791 [2019-12-27 06:17:43,647 INFO L226 Difference]: Without dead ends: 38002 [2019-12-27 06:17:43,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:17:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38002 states. [2019-12-27 06:17:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38002 to 23226. [2019-12-27 06:17:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23226 states. [2019-12-27 06:17:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23226 states to 23226 states and 70989 transitions. [2019-12-27 06:17:44,338 INFO L78 Accepts]: Start accepts. Automaton has 23226 states and 70989 transitions. Word has length 65 [2019-12-27 06:17:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:44,339 INFO L462 AbstractCegarLoop]: Abstraction has 23226 states and 70989 transitions. [2019-12-27 06:17:44,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 23226 states and 70989 transitions. [2019-12-27 06:17:44,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:17:44,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:44,365 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:44,365 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:44,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:44,366 INFO L82 PathProgramCache]: Analyzing trace with hash -118142618, now seen corresponding path program 3 times [2019-12-27 06:17:44,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:44,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541968452] [2019-12-27 06:17:44,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:44,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541968452] [2019-12-27 06:17:44,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:44,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:44,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909600122] [2019-12-27 06:17:44,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:44,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:44,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:44,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:44,442 INFO L87 Difference]: Start difference. First operand 23226 states and 70989 transitions. Second operand 7 states. [2019-12-27 06:17:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:44,875 INFO L93 Difference]: Finished difference Result 43950 states and 132286 transitions. [2019-12-27 06:17:44,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:17:44,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:17:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:44,931 INFO L225 Difference]: With dead ends: 43950 [2019-12-27 06:17:44,931 INFO L226 Difference]: Without dead ends: 41239 [2019-12-27 06:17:44,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:17:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41239 states. [2019-12-27 06:17:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41239 to 23322. [2019-12-27 06:17:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23322 states. [2019-12-27 06:17:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23322 states to 23322 states and 71333 transitions. [2019-12-27 06:17:45,437 INFO L78 Accepts]: Start accepts. Automaton has 23322 states and 71333 transitions. Word has length 65 [2019-12-27 06:17:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:45,437 INFO L462 AbstractCegarLoop]: Abstraction has 23322 states and 71333 transitions. [2019-12-27 06:17:45,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 23322 states and 71333 transitions. [2019-12-27 06:17:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:17:45,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:45,461 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:45,461 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:45,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash 659589900, now seen corresponding path program 4 times [2019-12-27 06:17:45,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:45,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139263697] [2019-12-27 06:17:45,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:45,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139263697] [2019-12-27 06:17:45,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:45,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:45,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256170761] [2019-12-27 06:17:45,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:45,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:45,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:45,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:45,528 INFO L87 Difference]: Start difference. First operand 23322 states and 71333 transitions. Second operand 3 states. [2019-12-27 06:17:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:45,615 INFO L93 Difference]: Finished difference Result 19336 states and 58062 transitions. [2019-12-27 06:17:45,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:45,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:17:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:45,651 INFO L225 Difference]: With dead ends: 19336 [2019-12-27 06:17:45,651 INFO L226 Difference]: Without dead ends: 19336 [2019-12-27 06:17:45,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19336 states. [2019-12-27 06:17:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19336 to 18026. [2019-12-27 06:17:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18026 states. [2019-12-27 06:17:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18026 states to 18026 states and 54104 transitions. [2019-12-27 06:17:46,021 INFO L78 Accepts]: Start accepts. Automaton has 18026 states and 54104 transitions. Word has length 65 [2019-12-27 06:17:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:46,022 INFO L462 AbstractCegarLoop]: Abstraction has 18026 states and 54104 transitions. [2019-12-27 06:17:46,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 18026 states and 54104 transitions. [2019-12-27 06:17:46,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:46,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:46,047 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:46,047 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:46,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:46,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1170584375, now seen corresponding path program 1 times [2019-12-27 06:17:46,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:46,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548998170] [2019-12-27 06:17:46,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:46,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548998170] [2019-12-27 06:17:46,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:46,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:17:46,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590680277] [2019-12-27 06:17:46,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:17:46,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:46,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:17:46,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:17:46,212 INFO L87 Difference]: Start difference. First operand 18026 states and 54104 transitions. Second operand 10 states. [2019-12-27 06:17:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:47,530 INFO L93 Difference]: Finished difference Result 26751 states and 79972 transitions. [2019-12-27 06:17:47,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:17:47,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 06:17:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:47,562 INFO L225 Difference]: With dead ends: 26751 [2019-12-27 06:17:47,562 INFO L226 Difference]: Without dead ends: 21704 [2019-12-27 06:17:47,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:17:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21704 states. [2019-12-27 06:17:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21704 to 18388. [2019-12-27 06:17:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18388 states. [2019-12-27 06:17:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18388 states to 18388 states and 55085 transitions. [2019-12-27 06:17:47,874 INFO L78 Accepts]: Start accepts. Automaton has 18388 states and 55085 transitions. Word has length 66 [2019-12-27 06:17:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:47,874 INFO L462 AbstractCegarLoop]: Abstraction has 18388 states and 55085 transitions. [2019-12-27 06:17:47,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:17:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 18388 states and 55085 transitions. [2019-12-27 06:17:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:47,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:47,893 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:47,893 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:47,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1395385759, now seen corresponding path program 2 times [2019-12-27 06:17:47,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:47,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824258224] [2019-12-27 06:17:47,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:48,174 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 06:17:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:48,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824258224] [2019-12-27 06:17:48,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:48,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:17:48,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142950601] [2019-12-27 06:17:48,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:17:48,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:48,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:17:48,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:48,208 INFO L87 Difference]: Start difference. First operand 18388 states and 55085 transitions. Second operand 9 states. [2019-12-27 06:17:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:50,542 INFO L93 Difference]: Finished difference Result 32317 states and 95157 transitions. [2019-12-27 06:17:50,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 06:17:50,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 06:17:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:50,588 INFO L225 Difference]: With dead ends: 32317 [2019-12-27 06:17:50,588 INFO L226 Difference]: Without dead ends: 32101 [2019-12-27 06:17:50,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-27 06:17:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32101 states. [2019-12-27 06:17:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32101 to 21436. [2019-12-27 06:17:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21436 states. [2019-12-27 06:17:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21436 states to 21436 states and 63981 transitions. [2019-12-27 06:17:51,015 INFO L78 Accepts]: Start accepts. Automaton has 21436 states and 63981 transitions. Word has length 66 [2019-12-27 06:17:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:51,015 INFO L462 AbstractCegarLoop]: Abstraction has 21436 states and 63981 transitions. [2019-12-27 06:17:51,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:17:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 21436 states and 63981 transitions. [2019-12-27 06:17:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:51,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:51,037 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:51,037 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:51,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:51,037 INFO L82 PathProgramCache]: Analyzing trace with hash 562079971, now seen corresponding path program 3 times [2019-12-27 06:17:51,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:51,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935973414] [2019-12-27 06:17:51,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:51,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935973414] [2019-12-27 06:17:51,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:51,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:17:51,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852002464] [2019-12-27 06:17:51,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:17:51,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:51,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:17:51,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:17:51,192 INFO L87 Difference]: Start difference. First operand 21436 states and 63981 transitions. Second operand 10 states. [2019-12-27 06:17:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:52,475 INFO L93 Difference]: Finished difference Result 33465 states and 98764 transitions. [2019-12-27 06:17:52,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:17:52,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 06:17:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:52,513 INFO L225 Difference]: With dead ends: 33465 [2019-12-27 06:17:52,513 INFO L226 Difference]: Without dead ends: 27949 [2019-12-27 06:17:52,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:17:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27949 states. [2019-12-27 06:17:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27949 to 22039. [2019-12-27 06:17:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22039 states. [2019-12-27 06:17:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22039 states to 22039 states and 65385 transitions. [2019-12-27 06:17:52,891 INFO L78 Accepts]: Start accepts. Automaton has 22039 states and 65385 transitions. Word has length 66 [2019-12-27 06:17:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:52,891 INFO L462 AbstractCegarLoop]: Abstraction has 22039 states and 65385 transitions. [2019-12-27 06:17:52,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:17:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 22039 states and 65385 transitions. [2019-12-27 06:17:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:52,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:52,912 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:52,912 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:52,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:52,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2145503905, now seen corresponding path program 4 times [2019-12-27 06:17:52,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:52,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991733346] [2019-12-27 06:17:52,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:53,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991733346] [2019-12-27 06:17:53,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:53,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:17:53,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001216121] [2019-12-27 06:17:53,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:17:53,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:53,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:17:53,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:17:53,114 INFO L87 Difference]: Start difference. First operand 22039 states and 65385 transitions. Second operand 11 states. [2019-12-27 06:17:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:54,510 INFO L93 Difference]: Finished difference Result 32079 states and 94432 transitions. [2019-12-27 06:17:54,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:17:54,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 06:17:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:54,548 INFO L225 Difference]: With dead ends: 32079 [2019-12-27 06:17:54,548 INFO L226 Difference]: Without dead ends: 27629 [2019-12-27 06:17:54,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:17:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27629 states. [2019-12-27 06:17:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27629 to 21567. [2019-12-27 06:17:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21567 states. [2019-12-27 06:17:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21567 states to 21567 states and 64023 transitions. [2019-12-27 06:17:55,056 INFO L78 Accepts]: Start accepts. Automaton has 21567 states and 64023 transitions. Word has length 66 [2019-12-27 06:17:55,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:55,057 INFO L462 AbstractCegarLoop]: Abstraction has 21567 states and 64023 transitions. [2019-12-27 06:17:55,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:17:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand 21567 states and 64023 transitions. [2019-12-27 06:17:55,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:55,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:55,077 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:55,077 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:55,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:55,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1023003475, now seen corresponding path program 5 times [2019-12-27 06:17:55,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:55,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145686685] [2019-12-27 06:17:55,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:55,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145686685] [2019-12-27 06:17:55,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:55,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:17:55,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987780067] [2019-12-27 06:17:55,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:17:55,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:55,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:17:55,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:17:55,255 INFO L87 Difference]: Start difference. First operand 21567 states and 64023 transitions. Second operand 12 states. [2019-12-27 06:17:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:57,211 INFO L93 Difference]: Finished difference Result 31727 states and 94000 transitions. [2019-12-27 06:17:57,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 06:17:57,211 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 06:17:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:57,250 INFO L225 Difference]: With dead ends: 31727 [2019-12-27 06:17:57,250 INFO L226 Difference]: Without dead ends: 27500 [2019-12-27 06:17:57,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2019-12-27 06:17:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27500 states. [2019-12-27 06:17:57,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27500 to 21909. [2019-12-27 06:17:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21909 states. [2019-12-27 06:17:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21909 states to 21909 states and 64887 transitions. [2019-12-27 06:17:57,630 INFO L78 Accepts]: Start accepts. Automaton has 21909 states and 64887 transitions. Word has length 66 [2019-12-27 06:17:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:57,630 INFO L462 AbstractCegarLoop]: Abstraction has 21909 states and 64887 transitions. [2019-12-27 06:17:57,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:17:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 21909 states and 64887 transitions. [2019-12-27 06:17:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:57,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:57,653 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:57,653 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:57,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1880052131, now seen corresponding path program 6 times [2019-12-27 06:17:57,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:57,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174990336] [2019-12-27 06:17:57,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:57,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174990336] [2019-12-27 06:17:57,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:57,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:17:57,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666664658] [2019-12-27 06:17:57,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:17:57,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:57,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:17:57,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:17:57,806 INFO L87 Difference]: Start difference. First operand 21909 states and 64887 transitions. Second operand 11 states. [2019-12-27 06:17:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:59,104 INFO L93 Difference]: Finished difference Result 47248 states and 139466 transitions. [2019-12-27 06:17:59,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 06:17:59,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 06:17:59,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:59,154 INFO L225 Difference]: With dead ends: 47248 [2019-12-27 06:17:59,154 INFO L226 Difference]: Without dead ends: 35869 [2019-12-27 06:17:59,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 06:17:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35869 states. [2019-12-27 06:17:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35869 to 20487. [2019-12-27 06:17:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20487 states. [2019-12-27 06:17:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20487 states to 20487 states and 60660 transitions. [2019-12-27 06:17:59,587 INFO L78 Accepts]: Start accepts. Automaton has 20487 states and 60660 transitions. Word has length 66 [2019-12-27 06:17:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:59,587 INFO L462 AbstractCegarLoop]: Abstraction has 20487 states and 60660 transitions. [2019-12-27 06:17:59,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:17:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 20487 states and 60660 transitions. [2019-12-27 06:17:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:59,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:59,610 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:59,610 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:59,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:59,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1192462261, now seen corresponding path program 7 times [2019-12-27 06:17:59,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:59,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817841356] [2019-12-27 06:17:59,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:59,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817841356] [2019-12-27 06:17:59,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:59,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:17:59,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064689588] [2019-12-27 06:17:59,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:17:59,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:59,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:17:59,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:59,751 INFO L87 Difference]: Start difference. First operand 20487 states and 60660 transitions. Second operand 9 states. [2019-12-27 06:18:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:02,384 INFO L93 Difference]: Finished difference Result 36391 states and 105669 transitions. [2019-12-27 06:18:02,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:18:02,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 06:18:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:02,434 INFO L225 Difference]: With dead ends: 36391 [2019-12-27 06:18:02,434 INFO L226 Difference]: Without dead ends: 36007 [2019-12-27 06:18:02,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:18:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36007 states. [2019-12-27 06:18:02,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36007 to 21924. [2019-12-27 06:18:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21924 states. [2019-12-27 06:18:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21924 states to 21924 states and 65160 transitions. [2019-12-27 06:18:02,865 INFO L78 Accepts]: Start accepts. Automaton has 21924 states and 65160 transitions. Word has length 66 [2019-12-27 06:18:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:02,865 INFO L462 AbstractCegarLoop]: Abstraction has 21924 states and 65160 transitions. [2019-12-27 06:18:02,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:18:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 21924 states and 65160 transitions. [2019-12-27 06:18:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:18:02,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:02,885 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:02,885 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:02,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:02,886 INFO L82 PathProgramCache]: Analyzing trace with hash 781937257, now seen corresponding path program 8 times [2019-12-27 06:18:02,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:02,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688672222] [2019-12-27 06:18:02,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:03,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688672222] [2019-12-27 06:18:03,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:03,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:18:03,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242534943] [2019-12-27 06:18:03,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:18:03,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:03,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:18:03,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:18:03,115 INFO L87 Difference]: Start difference. First operand 21924 states and 65160 transitions. Second operand 12 states. [2019-12-27 06:18:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:06,633 INFO L93 Difference]: Finished difference Result 40679 states and 118594 transitions. [2019-12-27 06:18:06,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 06:18:06,633 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 06:18:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:06,689 INFO L225 Difference]: With dead ends: 40679 [2019-12-27 06:18:06,689 INFO L226 Difference]: Without dead ends: 40483 [2019-12-27 06:18:06,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 06:18:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40483 states. [2019-12-27 06:18:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40483 to 23767. [2019-12-27 06:18:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23767 states. [2019-12-27 06:18:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23767 states to 23767 states and 70202 transitions. [2019-12-27 06:18:07,191 INFO L78 Accepts]: Start accepts. Automaton has 23767 states and 70202 transitions. Word has length 66 [2019-12-27 06:18:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:07,192 INFO L462 AbstractCegarLoop]: Abstraction has 23767 states and 70202 transitions. [2019-12-27 06:18:07,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:18:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 23767 states and 70202 transitions. [2019-12-27 06:18:07,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:18:07,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:07,213 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:07,214 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:07,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:07,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2031770045, now seen corresponding path program 9 times [2019-12-27 06:18:07,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:07,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201428657] [2019-12-27 06:18:07,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:07,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201428657] [2019-12-27 06:18:07,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:07,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:18:07,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731734098] [2019-12-27 06:18:07,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:18:07,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:07,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:18:07,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:18:07,317 INFO L87 Difference]: Start difference. First operand 23767 states and 70202 transitions. Second operand 4 states. [2019-12-27 06:18:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:07,534 INFO L93 Difference]: Finished difference Result 27232 states and 80790 transitions. [2019-12-27 06:18:07,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:07,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 06:18:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:07,595 INFO L225 Difference]: With dead ends: 27232 [2019-12-27 06:18:07,596 INFO L226 Difference]: Without dead ends: 27232 [2019-12-27 06:18:07,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:18:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27232 states. [2019-12-27 06:18:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27232 to 21030. [2019-12-27 06:18:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21030 states. [2019-12-27 06:18:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21030 states to 21030 states and 62871 transitions. [2019-12-27 06:18:08,357 INFO L78 Accepts]: Start accepts. Automaton has 21030 states and 62871 transitions. Word has length 66 [2019-12-27 06:18:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:08,357 INFO L462 AbstractCegarLoop]: Abstraction has 21030 states and 62871 transitions. [2019-12-27 06:18:08,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:18:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 21030 states and 62871 transitions. [2019-12-27 06:18:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:08,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:08,379 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:08,380 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:08,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:08,380 INFO L82 PathProgramCache]: Analyzing trace with hash -328200473, now seen corresponding path program 1 times [2019-12-27 06:18:08,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:08,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827042994] [2019-12-27 06:18:08,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:08,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827042994] [2019-12-27 06:18:08,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:08,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:18:08,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719093227] [2019-12-27 06:18:08,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:08,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:08,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:08,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:08,424 INFO L87 Difference]: Start difference. First operand 21030 states and 62871 transitions. Second operand 3 states. [2019-12-27 06:18:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:08,678 INFO L93 Difference]: Finished difference Result 28858 states and 86366 transitions. [2019-12-27 06:18:08,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:08,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 06:18:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:08,741 INFO L225 Difference]: With dead ends: 28858 [2019-12-27 06:18:08,741 INFO L226 Difference]: Without dead ends: 28858 [2019-12-27 06:18:08,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28858 states. [2019-12-27 06:18:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28858 to 21556. [2019-12-27 06:18:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21556 states. [2019-12-27 06:18:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21556 states to 21556 states and 64570 transitions. [2019-12-27 06:18:09,248 INFO L78 Accepts]: Start accepts. Automaton has 21556 states and 64570 transitions. Word has length 67 [2019-12-27 06:18:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:09,249 INFO L462 AbstractCegarLoop]: Abstraction has 21556 states and 64570 transitions. [2019-12-27 06:18:09,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:18:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 21556 states and 64570 transitions. [2019-12-27 06:18:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:09,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:09,270 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:09,271 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:09,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:09,271 INFO L82 PathProgramCache]: Analyzing trace with hash 608064189, now seen corresponding path program 1 times [2019-12-27 06:18:09,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:09,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934513541] [2019-12-27 06:18:09,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:09,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934513541] [2019-12-27 06:18:09,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:09,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:18:09,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288321296] [2019-12-27 06:18:09,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:18:09,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:09,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:18:09,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:18:09,419 INFO L87 Difference]: Start difference. First operand 21556 states and 64570 transitions. Second operand 11 states. [2019-12-27 06:18:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:10,649 INFO L93 Difference]: Finished difference Result 25773 states and 76402 transitions. [2019-12-27 06:18:10,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:18:10,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:18:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:10,685 INFO L225 Difference]: With dead ends: 25773 [2019-12-27 06:18:10,685 INFO L226 Difference]: Without dead ends: 25378 [2019-12-27 06:18:10,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:18:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25378 states. [2019-12-27 06:18:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25378 to 21548. [2019-12-27 06:18:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21548 states. [2019-12-27 06:18:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21548 states to 21548 states and 64540 transitions. [2019-12-27 06:18:11,035 INFO L78 Accepts]: Start accepts. Automaton has 21548 states and 64540 transitions. Word has length 67 [2019-12-27 06:18:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:11,036 INFO L462 AbstractCegarLoop]: Abstraction has 21548 states and 64540 transitions. [2019-12-27 06:18:11,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:18:11,036 INFO L276 IsEmpty]: Start isEmpty. Operand 21548 states and 64540 transitions. [2019-12-27 06:18:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:11,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:11,058 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:11,058 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:11,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:11,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1394809923, now seen corresponding path program 2 times [2019-12-27 06:18:11,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:11,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516333802] [2019-12-27 06:18:11,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:11,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516333802] [2019-12-27 06:18:11,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:11,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:18:11,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92107024] [2019-12-27 06:18:11,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:18:11,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:11,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:18:11,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:18:11,437 INFO L87 Difference]: Start difference. First operand 21548 states and 64540 transitions. Second operand 11 states. [2019-12-27 06:18:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:12,374 INFO L93 Difference]: Finished difference Result 37100 states and 111445 transitions. [2019-12-27 06:18:12,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:18:12,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:18:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:12,426 INFO L225 Difference]: With dead ends: 37100 [2019-12-27 06:18:12,426 INFO L226 Difference]: Without dead ends: 36629 [2019-12-27 06:18:12,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:18:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36629 states. [2019-12-27 06:18:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36629 to 21288. [2019-12-27 06:18:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21288 states. [2019-12-27 06:18:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21288 states to 21288 states and 63874 transitions. [2019-12-27 06:18:12,855 INFO L78 Accepts]: Start accepts. Automaton has 21288 states and 63874 transitions. Word has length 67 [2019-12-27 06:18:12,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:12,855 INFO L462 AbstractCegarLoop]: Abstraction has 21288 states and 63874 transitions. [2019-12-27 06:18:12,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:18:12,855 INFO L276 IsEmpty]: Start isEmpty. Operand 21288 states and 63874 transitions. [2019-12-27 06:18:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:12,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:12,877 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:12,877 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:12,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:12,878 INFO L82 PathProgramCache]: Analyzing trace with hash -614399051, now seen corresponding path program 3 times [2019-12-27 06:18:12,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:12,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569661623] [2019-12-27 06:18:12,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:18:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:18:12,993 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:18:12,994 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:18:12,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t913~0.base_26|) (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~a$read_delayed_var~0.base_7) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t913~0.base_26| 1)) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~a$r_buff1_thd3~0_48) (= v_~__unbuffered_p2_EBX~0_16 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z~0_7) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff1~0_23) (= 0 v_~a$w_buff0_used~0_113) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t913~0.base_26| 4)) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= v_~a$mem_tmp~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_#NULL.base_7|) (= 0 v_~y~0_8) (= v_~a$r_buff0_thd2~0_21 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t913~0.base_26|)) (= v_~main$tmp_guard1~0_15 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t913~0.base_26| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t913~0.base_26|) |v_ULTIMATE.start_main_~#t913~0.offset_19| 0)) |v_#memory_int_19|) (= 0 v_~a$w_buff0~0_26) (= 0 |v_ULTIMATE.start_main_~#t913~0.offset_19|) (= v_~a$r_buff0_thd3~0_79 0) (= 0 v_~a$w_buff1_used~0_68) (= 0 v_~a$r_buff1_thd2~0_18) (= v_~a~0_27 0) (= v_~a$r_buff0_thd0~0_21 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ULTIMATE.start_main_~#t914~0.base=|v_ULTIMATE.start_main_~#t914~0.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_26, ULTIMATE.start_main_~#t913~0.base=|v_ULTIMATE.start_main_~#t913~0.base_26|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ~a$read_delayed~0=v_~a$read_delayed~0_7, ULTIMATE.start_main_~#t915~0.base=|v_ULTIMATE.start_main_~#t915~0.base_17|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ULTIMATE.start_main_~#t915~0.offset=|v_ULTIMATE.start_main_~#t915~0.offset_14|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~a$w_buff1~0=v_~a$w_buff1~0_23, ~y~0=v_~y~0_8, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_~#t913~0.offset=|v_ULTIMATE.start_main_~#t913~0.offset_19|, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t914~0.offset=|v_ULTIMATE.start_main_~#t914~0.offset_16|, ~z~0=v_~z~0_7, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t914~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t913~0.base, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ULTIMATE.start_main_~#t915~0.base, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t915~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t913~0.offset, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t914~0.offset, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 06:18:12,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L750: Formula: (and (= ~a$r_buff1_thd2~0_Out-1029118692 ~a$r_buff0_thd2~0_In-1029118692) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1029118692 0)) (= ~a$r_buff0_thd1~0_Out-1029118692 1) (= ~a$r_buff0_thd0~0_In-1029118692 ~a$r_buff1_thd0~0_Out-1029118692) (= ~x~0_In-1029118692 ~__unbuffered_p0_EAX~0_Out-1029118692) (= ~a$r_buff0_thd1~0_In-1029118692 ~a$r_buff1_thd1~0_Out-1029118692) (= ~a$r_buff1_thd3~0_Out-1029118692 ~a$r_buff0_thd3~0_In-1029118692)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1029118692, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1029118692, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1029118692, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1029118692, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1029118692, ~x~0=~x~0_In-1029118692} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1029118692, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1029118692, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1029118692, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1029118692, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1029118692, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1029118692, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1029118692, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1029118692, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1029118692, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1029118692, ~x~0=~x~0_In-1029118692} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:18:13,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t914~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t914~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t914~0.base_11|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t914~0.base_11| 1)) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t914~0.base_11|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t914~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t914~0.base_11|) |v_ULTIMATE.start_main_~#t914~0.offset_10| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t914~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t914~0.offset=|v_ULTIMATE.start_main_~#t914~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t914~0.base=|v_ULTIMATE.start_main_~#t914~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t914~0.offset, #length, ULTIMATE.start_main_~#t914~0.base] because there is no mapped edge [2019-12-27 06:18:13,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1872517423 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1872517423 256) 0))) (or (and (not .cse0) (= ~a$w_buff1~0_In-1872517423 |P1Thread1of1ForFork2_#t~ite9_Out-1872517423|) (not .cse1)) (and (or .cse1 .cse0) (= ~a~0_In-1872517423 |P1Thread1of1ForFork2_#t~ite9_Out-1872517423|)))) InVars {~a~0=~a~0_In-1872517423, ~a$w_buff1~0=~a$w_buff1~0_In-1872517423, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1872517423, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1872517423} OutVars{~a~0=~a~0_In-1872517423, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1872517423|, ~a$w_buff1~0=~a$w_buff1~0_In-1872517423, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1872517423, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1872517423} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 06:18:13,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= v_~a~0_22 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_22, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 06:18:13,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1943800216 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1943800216 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1943800216|) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In-1943800216 |P1Thread1of1ForFork2_#t~ite11_Out-1943800216|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1943800216, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1943800216} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1943800216, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1943800216, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1943800216|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:18:13,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In210456709 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In210456709 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In210456709 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In210456709 256)))) (or (and (= ~a$w_buff1_used~0_In210456709 |P1Thread1of1ForFork2_#t~ite12_Out210456709|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out210456709| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In210456709, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In210456709, ~a$w_buff0_used~0=~a$w_buff0_used~0_In210456709, ~a$w_buff1_used~0=~a$w_buff1_used~0_In210456709} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In210456709, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In210456709, ~a$w_buff0_used~0=~a$w_buff0_used~0_In210456709, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out210456709|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In210456709} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:18:13,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-188747790 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-188747790 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-188747790| 0)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-188747790| ~a$r_buff0_thd2~0_In-188747790) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-188747790, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-188747790} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-188747790, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-188747790, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-188747790|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:18:13,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In77656374 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In77656374 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In77656374 256))) (.cse3 (= (mod ~a$r_buff1_thd2~0_In77656374 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out77656374| ~a$r_buff1_thd2~0_In77656374)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out77656374|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In77656374, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In77656374, ~a$w_buff0_used~0=~a$w_buff0_used~0_In77656374, ~a$w_buff1_used~0=~a$w_buff1_used~0_In77656374} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In77656374, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In77656374, ~a$w_buff0_used~0=~a$w_buff0_used~0_In77656374, ~a$w_buff1_used~0=~a$w_buff1_used~0_In77656374, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out77656374|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:18:13,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:18:13,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In917491113 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In917491113 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out917491113| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out917491113| ~a$w_buff0_used~0_In917491113)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In917491113, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In917491113} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out917491113|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In917491113, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In917491113} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:18:13,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1103504950 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1103504950 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-1103504950 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1103504950 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-1103504950| ~a$w_buff1_used~0_In-1103504950)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1103504950| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1103504950, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1103504950, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1103504950, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1103504950} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1103504950|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1103504950, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1103504950, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1103504950, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1103504950} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:18:13,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In208945643 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In208945643 256)))) (or (and (= ~a$r_buff0_thd1~0_Out208945643 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out208945643 ~a$r_buff0_thd1~0_In208945643)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In208945643, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In208945643} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out208945643|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In208945643, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out208945643} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:18:13,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1314785689 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-1314785689 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1314785689 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-1314785689 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In-1314785689 |P0Thread1of1ForFork1_#t~ite8_Out-1314785689|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1314785689|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1314785689, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1314785689, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1314785689, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1314785689} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1314785689|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1314785689, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1314785689, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1314785689, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1314785689} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:18:13,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L754-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~a$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:18:13,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L834-1-->L836: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t915~0.offset_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t915~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t915~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t915~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t915~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t915~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t915~0.base_11|) |v_ULTIMATE.start_main_~#t915~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t915~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t915~0.base=|v_ULTIMATE.start_main_~#t915~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t915~0.offset=|v_ULTIMATE.start_main_~#t915~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t915~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t915~0.offset] because there is no mapped edge [2019-12-27 06:18:13,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2013713030 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite30_Out2013713030| |P2Thread1of1ForFork0_#t~ite29_Out2013713030|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In2013713030 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In2013713030 256))) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In2013713030 256) 0)) (= (mod ~a$w_buff0_used~0_In2013713030 256) 0))) (= |P2Thread1of1ForFork0_#t~ite29_Out2013713030| ~a$w_buff1_used~0_In2013713030)) (and (= |P2Thread1of1ForFork0_#t~ite29_In2013713030| |P2Thread1of1ForFork0_#t~ite29_Out2013713030|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite30_Out2013713030| ~a$w_buff1_used~0_In2013713030)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2013713030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2013713030, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2013713030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2013713030, ~weak$$choice2~0=~weak$$choice2~0_In2013713030, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In2013713030|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2013713030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2013713030, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2013713030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2013713030, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out2013713030|, ~weak$$choice2~0=~weak$$choice2~0_In2013713030, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out2013713030|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 06:18:13,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (= v_~a$r_buff0_thd3~0_52 v_~a$r_buff0_thd3~0_51) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 06:18:13,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_20 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 06:18:13,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In662161426 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In662161426 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out662161426| ~a$w_buff1~0_In662161426) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out662161426| ~a~0_In662161426)))) InVars {~a~0=~a~0_In662161426, ~a$w_buff1~0=~a$w_buff1~0_In662161426, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In662161426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In662161426} OutVars{~a~0=~a~0_In662161426, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out662161426|, ~a$w_buff1~0=~a$w_buff1~0_In662161426, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In662161426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In662161426} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:18:13,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_18 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_18, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:18:13,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1476891503 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1476891503 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1476891503 |P2Thread1of1ForFork0_#t~ite40_Out1476891503|)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out1476891503| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1476891503, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1476891503} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1476891503|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1476891503, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1476891503} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 06:18:13,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-1449270991 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-1449270991 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1449270991 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1449270991 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-1449270991| ~a$w_buff1_used~0_In-1449270991) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out-1449270991| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1449270991, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1449270991, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1449270991, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1449270991} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1449270991, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1449270991, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1449270991, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1449270991, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1449270991|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 06:18:13,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-2037189931 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2037189931 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-2037189931|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-2037189931| ~a$r_buff0_thd3~0_In-2037189931)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2037189931, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2037189931} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2037189931, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2037189931, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-2037189931|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 06:18:13,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In874458350 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In874458350 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In874458350 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In874458350 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out874458350| 0)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out874458350| ~a$r_buff1_thd3~0_In874458350) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In874458350, ~a$w_buff0_used~0=~a$w_buff0_used~0_In874458350, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In874458350, ~a$w_buff1_used~0=~a$w_buff1_used~0_In874458350} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out874458350|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In874458350, ~a$w_buff0_used~0=~a$w_buff0_used~0_In874458350, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In874458350, ~a$w_buff1_used~0=~a$w_buff1_used~0_In874458350} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 06:18:13,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:18:13,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:18:13,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-2127019036 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-2127019036 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-2127019036| |ULTIMATE.start_main_#t~ite47_Out-2127019036|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-2127019036| ~a$w_buff1~0_In-2127019036) .cse0 (not .cse1) (not .cse2)) (and (= ~a~0_In-2127019036 |ULTIMATE.start_main_#t~ite47_Out-2127019036|) (or .cse1 .cse2) .cse0))) InVars {~a~0=~a~0_In-2127019036, ~a$w_buff1~0=~a$w_buff1~0_In-2127019036, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2127019036, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2127019036} OutVars{~a~0=~a~0_In-2127019036, ~a$w_buff1~0=~a$w_buff1~0_In-2127019036, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2127019036|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2127019036, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-2127019036|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2127019036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:18:13,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1113866967 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1113866967 256)))) (or (and (= ~a$w_buff0_used~0_In-1113866967 |ULTIMATE.start_main_#t~ite49_Out-1113866967|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1113866967|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1113866967, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1113866967} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1113866967, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1113866967|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1113866967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:18:13,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1976366894 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In1976366894 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1976366894 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1976366894 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1976366894| 0)) (and (= ~a$w_buff1_used~0_In1976366894 |ULTIMATE.start_main_#t~ite50_Out1976366894|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1976366894, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1976366894, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1976366894, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1976366894} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1976366894|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1976366894, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1976366894, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1976366894, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1976366894} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:18:13,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-430261310 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-430261310 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-430261310| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-430261310| ~a$r_buff0_thd0~0_In-430261310)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-430261310, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-430261310} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-430261310|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-430261310, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-430261310} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:18:13,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-727637169 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-727637169 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd0~0_In-727637169 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-727637169 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-727637169| ~a$r_buff1_thd0~0_In-727637169) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out-727637169| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-727637169, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-727637169, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-727637169, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-727637169} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-727637169|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-727637169, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-727637169, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-727637169, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-727637169} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:18:13,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite52_13| v_~a$r_buff1_thd0~0_19) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:18:13,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:18:13 BasicIcfg [2019-12-27 06:18:13,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:18:13,103 INFO L168 Benchmark]: Toolchain (without parser) took 111963.29 ms. Allocated memory was 145.2 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.4 MB in the beginning and 943.7 MB in the end (delta: -842.2 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 06:18:13,103 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:18:13,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.86 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.2 MB in the beginning and 153.1 MB in the end (delta: -51.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:13,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.98 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 150.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:13,105 INFO L168 Benchmark]: Boogie Preprocessor took 38.54 ms. Allocated memory is still 201.9 MB. Free memory was 150.3 MB in the beginning and 148.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:13,105 INFO L168 Benchmark]: RCFGBuilder took 928.42 ms. Allocated memory is still 201.9 MB. Free memory was 148.2 MB in the beginning and 97.1 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:13,105 INFO L168 Benchmark]: TraceAbstraction took 110135.78 ms. Allocated memory was 201.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 97.1 MB in the beginning and 943.7 MB in the end (delta: -846.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 06:18:13,107 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.86 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.2 MB in the beginning and 153.1 MB in the end (delta: -51.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.98 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 150.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.54 ms. Allocated memory is still 201.9 MB. Free memory was 150.3 MB in the beginning and 148.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 928.42 ms. Allocated memory is still 201.9 MB. Free memory was 148.2 MB in the beginning and 97.1 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 110135.78 ms. Allocated memory was 201.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 97.1 MB in the beginning and 943.7 MB in the end (delta: -846.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7337 VarBasedMoverChecksPositive, 224 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 86659 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t915, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 109.8s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 35.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8684 SDtfs, 9175 SDslu, 31195 SDs, 0 SdLazy, 19059 SolverSat, 302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 53 SyntacticMatches, 17 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163842occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 262529 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1535 NumberOfCodeBlocks, 1535 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1435 ConstructedInterpolants, 0 QuantifiedInterpolants, 308218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...