/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:50:53,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:50:53,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:50:53,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:50:53,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:50:53,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:50:53,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:50:53,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:50:53,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:50:53,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:50:53,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:50:53,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:50:53,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:50:53,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:50:53,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:50:53,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:50:53,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:50:53,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:50:53,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:50:53,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:50:53,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:50:53,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:50:53,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:50:53,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:50:53,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:50:53,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:50:53,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:50:53,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:50:53,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:50:53,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:50:53,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:50:53,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:50:53,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:50:53,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:50:53,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:50:53,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:50:53,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:50:53,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:50:53,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:50:53,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:50:53,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:50:53,886 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-SemanticLbe.epf [2019-12-18 16:50:53,921 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:50:53,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:50:53,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:50:53,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:50:53,927 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:50:53,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:50:53,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:50:53,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:50:53,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:50:53,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:50:53,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:50:53,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:50:53,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:50:53,930 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:50:53,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:50:53,931 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:50:53,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:50:53,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:50:53,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:50:53,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:50:53,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:50:53,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:50:53,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:50:53,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:50:53,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:50:53,935 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:50:53,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:50:53,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:50:53,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:50:54,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:50:54,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:50:54,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:50:54,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:50:54,221 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:50:54,222 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i [2019-12-18 16:50:54,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/651daf5a7/60705cca20f24cb88dec18e966992cca/FLAG010cae503 [2019-12-18 16:50:54,878 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:50:54,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i [2019-12-18 16:50:54,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/651daf5a7/60705cca20f24cb88dec18e966992cca/FLAG010cae503 [2019-12-18 16:50:55,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/651daf5a7/60705cca20f24cb88dec18e966992cca [2019-12-18 16:50:55,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:50:55,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:50:55,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:50:55,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:50:55,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:50:55,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:50:55" (1/1) ... [2019-12-18 16:50:55,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55, skipping insertion in model container [2019-12-18 16:50:55,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:50:55" (1/1) ... [2019-12-18 16:50:55,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:50:55,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:50:55,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:50:55,730 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:50:55,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:50:55,947 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:50:55,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55 WrapperNode [2019-12-18 16:50:55,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:50:55,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:50:55,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:50:55,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:50:55,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55" (1/1) ... [2019-12-18 16:50:55,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55" (1/1) ... [2019-12-18 16:50:56,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:50:56,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:50:56,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:50:56,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:50:56,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55" (1/1) ... [2019-12-18 16:50:56,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55" (1/1) ... [2019-12-18 16:50:56,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55" (1/1) ... [2019-12-18 16:50:56,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55" (1/1) ... [2019-12-18 16:50:56,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55" (1/1) ... [2019-12-18 16:50:56,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55" (1/1) ... [2019-12-18 16:50:56,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55" (1/1) ... [2019-12-18 16:50:56,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:50:56,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:50:56,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:50:56,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:50:56,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55" (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-18 16:50:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:50:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:50:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:50:56,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:50:56,131 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:50:56,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:50:56,131 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:50:56,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:50:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:50:56,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:50:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:50:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:50:56,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:50:56,134 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:50:56,906 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:50:56,907 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:50:56,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:50:56 BoogieIcfgContainer [2019-12-18 16:50:56,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:50:56,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:50:56,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:50:56,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:50:56,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:50:55" (1/3) ... [2019-12-18 16:50:56,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1be4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:50:56, skipping insertion in model container [2019-12-18 16:50:56,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:55" (2/3) ... [2019-12-18 16:50:56,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1be4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:50:56, skipping insertion in model container [2019-12-18 16:50:56,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:50:56" (3/3) ... [2019-12-18 16:50:56,917 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_tso.opt.i [2019-12-18 16:50:56,928 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:50:56,928 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:50:56,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:50:56,937 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:50:56,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:56,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,019 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,019 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,047 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,049 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,057 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,057 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,057 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,064 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:57,082 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:50:57,103 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:50:57,103 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:50:57,103 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:50:57,104 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:50:57,104 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:50:57,104 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:50:57,104 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:50:57,104 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:50:57,128 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 16:50:57,130 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 16:50:57,232 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 16:50:57,233 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:50:57,252 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 431 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:50:57,283 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 16:50:57,331 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 16:50:57,331 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:50:57,340 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 431 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:50:57,362 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 16:50:57,363 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:51:02,396 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-18 16:51:02,813 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 16:51:02,958 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 16:51:02,985 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-18 16:51:02,985 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 16:51:02,989 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 16:51:20,788 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-18 16:51:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-18 16:51:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:51:20,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:20,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:51:20,798 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-18 16:51:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-18 16:51:20,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:20,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687943434] [2019-12-18 16:51:20,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:21,063 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-18 16:51:21,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687943434] [2019-12-18 16:51:21,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:21,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:51:21,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001122291] [2019-12-18 16:51:21,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:51:21,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:21,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:51:21,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:51:21,092 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-18 16:51:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:22,368 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-18 16:51:22,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:51:22,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:51:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:26,150 INFO L225 Difference]: With dead ends: 114110 [2019-12-18 16:51:26,150 INFO L226 Difference]: Without dead ends: 107012 [2019-12-18 16:51:26,152 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-18 16:51:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-18 16:51:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-18 16:51:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-18 16:51:37,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-18 16:51:37,277 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-18 16:51:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:37,277 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-18 16:51:37,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:51:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-18 16:51:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:51:37,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:37,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:51:37,282 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-18 16:51:37,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:37,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-18 16:51:37,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:37,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929724389] [2019-12-18 16:51:37,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:37,390 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-18 16:51:37,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929724389] [2019-12-18 16:51:37,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:37,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:51:37,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565178804] [2019-12-18 16:51:37,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:51:37,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:51:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:51:37,393 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-18 16:51:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:42,862 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-18 16:51:42,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:51:42,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:51:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:43,456 INFO L225 Difference]: With dead ends: 166210 [2019-12-18 16:51:43,457 INFO L226 Difference]: Without dead ends: 166161 [2019-12-18 16:51:43,458 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-18 16:51:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-18 16:51:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-18 16:51:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-18 16:51:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-18 16:51:52,168 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-18 16:51:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:52,169 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-18 16:51:52,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:51:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-18 16:51:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:51:52,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:52,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:51:52,175 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-18 16:51:52,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:52,175 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-18 16:51:52,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:52,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147834805] [2019-12-18 16:51:52,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:52,259 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-18 16:51:52,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147834805] [2019-12-18 16:51:52,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:52,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:51:52,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205794736] [2019-12-18 16:51:52,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:51:52,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:52,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:51:52,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:51:52,261 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-18 16:51:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:52,382 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-18 16:51:52,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:51:52,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:51:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:52,459 INFO L225 Difference]: With dead ends: 33068 [2019-12-18 16:51:52,459 INFO L226 Difference]: Without dead ends: 33068 [2019-12-18 16:51:52,460 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-18 16:51:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-18 16:51:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-18 16:51:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-18 16:51:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-18 16:51:57,801 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-18 16:51:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:57,802 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-18 16:51:57,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:51:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-18 16:51:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:51:57,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:57,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:51:57,806 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-18 16:51:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:57,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-18 16:51:57,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:57,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200528099] [2019-12-18 16:51:57,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:57,901 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-18 16:51:57,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200528099] [2019-12-18 16:51:57,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:57,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:51:57,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094954573] [2019-12-18 16:51:57,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:51:57,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:57,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:51:57,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:51:57,903 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-18 16:51:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:58,368 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-18 16:51:58,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:51:58,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 16:51:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:58,440 INFO L225 Difference]: With dead ends: 45410 [2019-12-18 16:51:58,440 INFO L226 Difference]: Without dead ends: 45410 [2019-12-18 16:51:58,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:51:58,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-18 16:51:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-18 16:51:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-18 16:51:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-18 16:51:59,483 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-18 16:51:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:59,484 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-18 16:51:59,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:51:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-18 16:51:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:51:59,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:59,494 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-18 16:51:59,494 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-18 16:51:59,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:59,495 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-18 16:51:59,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:59,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947815857] [2019-12-18 16:51:59,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:59,621 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-18 16:51:59,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947815857] [2019-12-18 16:51:59,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:59,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:51:59,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467401958] [2019-12-18 16:51:59,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:51:59,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:59,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:51:59,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:51:59,623 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 6 states. [2019-12-18 16:52:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:00,648 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-18 16:52:00,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:52:00,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 16:52:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:00,740 INFO L225 Difference]: With dead ends: 56872 [2019-12-18 16:52:00,740 INFO L226 Difference]: Without dead ends: 56865 [2019-12-18 16:52:00,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:52:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-18 16:52:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-18 16:52:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-18 16:52:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-18 16:52:01,948 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-18 16:52:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:01,948 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-18 16:52:01,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:52:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-18 16:52:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:52:01,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:01,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] [2019-12-18 16:52:01,963 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-18 16:52:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:01,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-18 16:52:01,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:01,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267087285] [2019-12-18 16:52:01,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:02,028 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-18 16:52:02,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267087285] [2019-12-18 16:52:02,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:02,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:52:02,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401526471] [2019-12-18 16:52:02,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:52:02,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:02,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:52:02,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:52:02,030 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 4 states. [2019-12-18 16:52:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:02,093 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-18 16:52:02,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:52:02,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:52:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:02,115 INFO L225 Difference]: With dead ends: 16014 [2019-12-18 16:52:02,115 INFO L226 Difference]: Without dead ends: 16014 [2019-12-18 16:52:02,116 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-18 16:52:02,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-18 16:52:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-18 16:52:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-18 16:52:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-18 16:52:02,354 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-18 16:52:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:02,354 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-18 16:52:02,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:52:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-18 16:52:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:52:02,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:02,367 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-18 16:52:02,367 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-18 16:52:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-18 16:52:02,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:02,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693402794] [2019-12-18 16:52:02,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:02,461 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-18 16:52:02,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693402794] [2019-12-18 16:52:02,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:02,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:52:02,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194045315] [2019-12-18 16:52:02,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:52:02,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:02,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:52:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:52:02,463 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-18 16:52:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:03,045 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-18 16:52:03,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:52:03,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 16:52:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:03,081 INFO L225 Difference]: With dead ends: 22624 [2019-12-18 16:52:03,081 INFO L226 Difference]: Without dead ends: 22624 [2019-12-18 16:52:03,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:52:03,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-18 16:52:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-18 16:52:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-18 16:52:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-18 16:52:03,387 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-18 16:52:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:03,388 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-18 16:52:03,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:52:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-18 16:52:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 16:52:03,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:03,407 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-18 16:52:03,407 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-18 16:52:03,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:03,408 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-18 16:52:03,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:03,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158578505] [2019-12-18 16:52:03,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:03,508 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-18 16:52:03,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158578505] [2019-12-18 16:52:03,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:03,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:52:03,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235717135] [2019-12-18 16:52:03,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:03,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:03,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:03,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:03,510 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 7 states. [2019-12-18 16:52:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:04,888 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-18 16:52:04,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:52:04,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 16:52:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:04,921 INFO L225 Difference]: With dead ends: 24689 [2019-12-18 16:52:04,922 INFO L226 Difference]: Without dead ends: 24689 [2019-12-18 16:52:04,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:52:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-18 16:52:05,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-18 16:52:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-18 16:52:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-18 16:52:05,221 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-18 16:52:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:05,221 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-18 16:52:05,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-18 16:52:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:52:05,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:05,245 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-18 16:52:05,245 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-18 16:52:05,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:05,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-18 16:52:05,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:05,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93697888] [2019-12-18 16:52:05,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:05,314 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-18 16:52:05,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93697888] [2019-12-18 16:52:05,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:05,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:52:05,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257853606] [2019-12-18 16:52:05,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:52:05,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:05,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:52:05,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:05,316 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-18 16:52:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:05,456 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-18 16:52:05,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:52:05,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:52:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:05,498 INFO L225 Difference]: With dead ends: 31245 [2019-12-18 16:52:05,498 INFO L226 Difference]: Without dead ends: 17019 [2019-12-18 16:52:05,499 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-18 16:52:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-18 16:52:05,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-18 16:52:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-18 16:52:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-18 16:52:05,911 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-18 16:52:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:05,911 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-18 16:52:05,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:52:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-18 16:52:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:52:05,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:05,946 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-18 16:52:05,946 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-18 16:52:05,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:05,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-18 16:52:05,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:05,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478959776] [2019-12-18 16:52:05,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:06,037 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-18 16:52:06,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478959776] [2019-12-18 16:52:06,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:06,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:52:06,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234573196] [2019-12-18 16:52:06,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:52:06,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:52:06,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:52:06,039 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 4 states. [2019-12-18 16:52:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:06,122 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-18 16:52:06,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:52:06,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 16:52:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:06,137 INFO L225 Difference]: With dead ends: 24032 [2019-12-18 16:52:06,137 INFO L226 Difference]: Without dead ends: 10093 [2019-12-18 16:52:06,137 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-18 16:52:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-18 16:52:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-18 16:52:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-18 16:52:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-18 16:52:06,285 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-18 16:52:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:06,286 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-18 16:52:06,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:52:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-18 16:52:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:52:06,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:06,299 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-18 16:52:06,300 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-18 16:52:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-18 16:52:06,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:06,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427823372] [2019-12-18 16:52:06,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:06,361 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-18 16:52:06,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427823372] [2019-12-18 16:52:06,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:06,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:52:06,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025157955] [2019-12-18 16:52:06,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:52:06,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:06,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:52:06,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:52:06,363 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 5 states. [2019-12-18 16:52:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:06,411 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-18 16:52:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:52:06,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:52:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:06,423 INFO L225 Difference]: With dead ends: 9224 [2019-12-18 16:52:06,423 INFO L226 Difference]: Without dead ends: 6480 [2019-12-18 16:52:06,424 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-18 16:52:06,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-18 16:52:06,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-18 16:52:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-18 16:52:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-18 16:52:06,733 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-18 16:52:06,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:06,734 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-18 16:52:06,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:52:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-18 16:52:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:06,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:06,742 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] [2019-12-18 16:52:06,742 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-18 16:52:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:06,743 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-18 16:52:06,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:06,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418859239] [2019-12-18 16:52:06,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:06,791 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-18 16:52:06,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418859239] [2019-12-18 16:52:06,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:06,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:52:06,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043718256] [2019-12-18 16:52:06,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:52:06,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:06,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:52:06,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:06,794 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-18 16:52:06,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:06,884 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-18 16:52:06,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:52:06,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:52:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:06,902 INFO L225 Difference]: With dead ends: 9612 [2019-12-18 16:52:06,902 INFO L226 Difference]: Without dead ends: 9612 [2019-12-18 16:52:06,903 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-18 16:52:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-18 16:52:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-18 16:52:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-18 16:52:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-18 16:52:07,093 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-18 16:52:07,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:07,094 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-18 16:52:07,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:52:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-18 16:52:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:07,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:07,103 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] [2019-12-18 16:52:07,103 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-18 16:52:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:07,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-18 16:52:07,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:07,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097378793] [2019-12-18 16:52:07,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:07,197 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-18 16:52:07,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097378793] [2019-12-18 16:52:07,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:07,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:52:07,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241009181] [2019-12-18 16:52:07,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:07,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:07,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:07,201 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 7 states. [2019-12-18 16:52:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:07,500 INFO L93 Difference]: Finished difference Result 14786 states and 46379 transitions. [2019-12-18 16:52:07,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:52:07,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:52:07,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:07,516 INFO L225 Difference]: With dead ends: 14786 [2019-12-18 16:52:07,516 INFO L226 Difference]: Without dead ends: 11103 [2019-12-18 16:52:07,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:52:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2019-12-18 16:52:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 9096. [2019-12-18 16:52:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-18 16:52:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-18 16:52:07,679 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-18 16:52:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:07,679 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-18 16:52:07,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-18 16:52:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:07,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:07,690 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] [2019-12-18 16:52:07,690 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-18 16:52:07,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:07,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-18 16:52:07,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:07,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365653222] [2019-12-18 16:52:07,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:07,784 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-18 16:52:07,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365653222] [2019-12-18 16:52:07,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:07,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:52:07,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351646309] [2019-12-18 16:52:07,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:07,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:07,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:07,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:07,788 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 7 states. [2019-12-18 16:52:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:08,134 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-18 16:52:08,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:52:08,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:52:08,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:08,161 INFO L225 Difference]: With dead ends: 16709 [2019-12-18 16:52:08,162 INFO L226 Difference]: Without dead ends: 12623 [2019-12-18 16:52:08,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:52:08,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-18 16:52:08,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-18 16:52:08,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-18 16:52:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-18 16:52:08,429 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-18 16:52:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:08,429 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-18 16:52:08,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-18 16:52:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:08,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:08,445 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] [2019-12-18 16:52:08,445 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-18 16:52:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:08,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-18 16:52:08,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:08,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834239906] [2019-12-18 16:52:08,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:08,586 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-18 16:52:08,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834239906] [2019-12-18 16:52:08,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:08,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:52:08,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533267555] [2019-12-18 16:52:08,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:52:08,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:08,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:52:08,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:52:08,588 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 9 states. [2019-12-18 16:52:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:09,803 INFO L93 Difference]: Finished difference Result 36233 states and 111090 transitions. [2019-12-18 16:52:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 16:52:09,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 16:52:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:09,859 INFO L225 Difference]: With dead ends: 36233 [2019-12-18 16:52:09,860 INFO L226 Difference]: Without dead ends: 32009 [2019-12-18 16:52:09,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:52:09,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32009 states. [2019-12-18 16:52:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32009 to 10214. [2019-12-18 16:52:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10214 states. [2019-12-18 16:52:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 32290 transitions. [2019-12-18 16:52:10,397 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 32290 transitions. Word has length 64 [2019-12-18 16:52:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:10,398 INFO L462 AbstractCegarLoop]: Abstraction has 10214 states and 32290 transitions. [2019-12-18 16:52:10,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:52:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 32290 transitions. [2019-12-18 16:52:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:10,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:10,414 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] [2019-12-18 16:52:10,414 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-18 16:52:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1900940369, now seen corresponding path program 1 times [2019-12-18 16:52:10,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:10,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593413480] [2019-12-18 16:52:10,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:10,458 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-18 16:52:10,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593413480] [2019-12-18 16:52:10,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:10,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:52:10,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270348082] [2019-12-18 16:52:10,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:52:10,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:10,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:52:10,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:10,460 INFO L87 Difference]: Start difference. First operand 10214 states and 32290 transitions. Second operand 3 states. [2019-12-18 16:52:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:10,538 INFO L93 Difference]: Finished difference Result 12867 states and 40113 transitions. [2019-12-18 16:52:10,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:52:10,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:52:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:10,561 INFO L225 Difference]: With dead ends: 12867 [2019-12-18 16:52:10,561 INFO L226 Difference]: Without dead ends: 12867 [2019-12-18 16:52:10,562 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-18 16:52:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12867 states. [2019-12-18 16:52:10,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12867 to 10671. [2019-12-18 16:52:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10671 states. [2019-12-18 16:52:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 33392 transitions. [2019-12-18 16:52:10,767 INFO L78 Accepts]: Start accepts. Automaton has 10671 states and 33392 transitions. Word has length 64 [2019-12-18 16:52:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:10,768 INFO L462 AbstractCegarLoop]: Abstraction has 10671 states and 33392 transitions. [2019-12-18 16:52:10,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:52:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 10671 states and 33392 transitions. [2019-12-18 16:52:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:10,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:10,785 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] [2019-12-18 16:52:10,786 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-18 16:52:10,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:10,786 INFO L82 PathProgramCache]: Analyzing trace with hash -612356637, now seen corresponding path program 4 times [2019-12-18 16:52:10,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:10,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247389387] [2019-12-18 16:52:10,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:10,907 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-18 16:52:10,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247389387] [2019-12-18 16:52:10,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:10,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:52:10,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798268314] [2019-12-18 16:52:10,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:52:10,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:10,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:52:10,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:52:10,909 INFO L87 Difference]: Start difference. First operand 10671 states and 33392 transitions. Second operand 9 states. [2019-12-18 16:52:11,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:11,964 INFO L93 Difference]: Finished difference Result 28791 states and 88355 transitions. [2019-12-18 16:52:11,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:52:11,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 16:52:11,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:12,002 INFO L225 Difference]: With dead ends: 28791 [2019-12-18 16:52:12,002 INFO L226 Difference]: Without dead ends: 26476 [2019-12-18 16:52:12,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:52:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-18 16:52:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 10699. [2019-12-18 16:52:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2019-12-18 16:52:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 33546 transitions. [2019-12-18 16:52:12,274 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 33546 transitions. Word has length 64 [2019-12-18 16:52:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:12,274 INFO L462 AbstractCegarLoop]: Abstraction has 10699 states and 33546 transitions. [2019-12-18 16:52:12,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:52:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 33546 transitions. [2019-12-18 16:52:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:12,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:12,286 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] [2019-12-18 16:52:12,286 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-18 16:52:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 5 times [2019-12-18 16:52:12,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:12,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455939444] [2019-12-18 16:52:12,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:12,369 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-18 16:52:12,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455939444] [2019-12-18 16:52:12,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:12,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:52:12,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682421865] [2019-12-18 16:52:12,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:52:12,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:12,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:52:12,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:52:12,373 INFO L87 Difference]: Start difference. First operand 10699 states and 33546 transitions. Second operand 5 states. [2019-12-18 16:52:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:12,688 INFO L93 Difference]: Finished difference Result 12384 states and 38249 transitions. [2019-12-18 16:52:12,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:52:12,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 16:52:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:12,707 INFO L225 Difference]: With dead ends: 12384 [2019-12-18 16:52:12,708 INFO L226 Difference]: Without dead ends: 12384 [2019-12-18 16:52:12,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:52:12,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12384 states. [2019-12-18 16:52:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12384 to 11630. [2019-12-18 16:52:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11630 states. [2019-12-18 16:52:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11630 states to 11630 states and 36167 transitions. [2019-12-18 16:52:12,895 INFO L78 Accepts]: Start accepts. Automaton has 11630 states and 36167 transitions. Word has length 64 [2019-12-18 16:52:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:12,896 INFO L462 AbstractCegarLoop]: Abstraction has 11630 states and 36167 transitions. [2019-12-18 16:52:12,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:52:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 11630 states and 36167 transitions. [2019-12-18 16:52:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:12,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:12,909 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] [2019-12-18 16:52:12,909 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-18 16:52:12,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:12,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1714079827, now seen corresponding path program 6 times [2019-12-18 16:52:12,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:12,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838713593] [2019-12-18 16:52:12,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:12,995 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-18 16:52:12,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838713593] [2019-12-18 16:52:12,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:12,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:52:12,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201636055] [2019-12-18 16:52:12,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:12,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:12,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:12,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:12,998 INFO L87 Difference]: Start difference. First operand 11630 states and 36167 transitions. Second operand 7 states. [2019-12-18 16:52:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:14,093 INFO L93 Difference]: Finished difference Result 20495 states and 61153 transitions. [2019-12-18 16:52:14,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:52:14,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:52:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:14,122 INFO L225 Difference]: With dead ends: 20495 [2019-12-18 16:52:14,122 INFO L226 Difference]: Without dead ends: 20327 [2019-12-18 16:52:14,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:52:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20327 states. [2019-12-18 16:52:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20327 to 17055. [2019-12-18 16:52:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17055 states. [2019-12-18 16:52:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17055 states to 17055 states and 51675 transitions. [2019-12-18 16:52:14,414 INFO L78 Accepts]: Start accepts. Automaton has 17055 states and 51675 transitions. Word has length 64 [2019-12-18 16:52:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:14,415 INFO L462 AbstractCegarLoop]: Abstraction has 17055 states and 51675 transitions. [2019-12-18 16:52:14,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 17055 states and 51675 transitions. [2019-12-18 16:52:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:14,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:14,433 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] [2019-12-18 16:52:14,433 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-18 16:52:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash 768567647, now seen corresponding path program 7 times [2019-12-18 16:52:14,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:14,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853986643] [2019-12-18 16:52:14,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:14,534 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-18 16:52:14,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853986643] [2019-12-18 16:52:14,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:14,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:52:14,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809525049] [2019-12-18 16:52:14,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:52:14,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:14,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:52:14,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:52:14,536 INFO L87 Difference]: Start difference. First operand 17055 states and 51675 transitions. Second operand 6 states. [2019-12-18 16:52:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:15,626 INFO L93 Difference]: Finished difference Result 30832 states and 92113 transitions. [2019-12-18 16:52:15,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 16:52:15,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 16:52:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:15,685 INFO L225 Difference]: With dead ends: 30832 [2019-12-18 16:52:15,685 INFO L226 Difference]: Without dead ends: 30612 [2019-12-18 16:52:15,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:52:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30612 states. [2019-12-18 16:52:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30612 to 22076. [2019-12-18 16:52:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22076 states. [2019-12-18 16:52:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22076 states to 22076 states and 66013 transitions. [2019-12-18 16:52:16,152 INFO L78 Accepts]: Start accepts. Automaton has 22076 states and 66013 transitions. Word has length 64 [2019-12-18 16:52:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:16,152 INFO L462 AbstractCegarLoop]: Abstraction has 22076 states and 66013 transitions. [2019-12-18 16:52:16,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:52:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 22076 states and 66013 transitions. [2019-12-18 16:52:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:16,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:16,178 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] [2019-12-18 16:52:16,178 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-18 16:52:16,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:16,178 INFO L82 PathProgramCache]: Analyzing trace with hash 908702963, now seen corresponding path program 8 times [2019-12-18 16:52:16,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:16,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093837500] [2019-12-18 16:52:16,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:16,291 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-18 16:52:16,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093837500] [2019-12-18 16:52:16,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:16,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:52:16,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9260881] [2019-12-18 16:52:16,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:16,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:16,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:16,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:16,294 INFO L87 Difference]: Start difference. First operand 22076 states and 66013 transitions. Second operand 7 states. [2019-12-18 16:52:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:16,999 INFO L93 Difference]: Finished difference Result 26232 states and 77397 transitions. [2019-12-18 16:52:16,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 16:52:16,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:52:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:17,034 INFO L225 Difference]: With dead ends: 26232 [2019-12-18 16:52:17,034 INFO L226 Difference]: Without dead ends: 26232 [2019-12-18 16:52:17,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:52:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26232 states. [2019-12-18 16:52:17,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26232 to 23702. [2019-12-18 16:52:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23702 states. [2019-12-18 16:52:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23702 states to 23702 states and 70494 transitions. [2019-12-18 16:52:17,689 INFO L78 Accepts]: Start accepts. Automaton has 23702 states and 70494 transitions. Word has length 64 [2019-12-18 16:52:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:17,689 INFO L462 AbstractCegarLoop]: Abstraction has 23702 states and 70494 transitions. [2019-12-18 16:52:17,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 23702 states and 70494 transitions. [2019-12-18 16:52:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:17,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:17,717 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] [2019-12-18 16:52:17,717 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-18 16:52:17,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:17,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1398237635, now seen corresponding path program 9 times [2019-12-18 16:52:17,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:17,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843123385] [2019-12-18 16:52:17,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:17,828 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-18 16:52:17,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843123385] [2019-12-18 16:52:17,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:17,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:52:17,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096413887] [2019-12-18 16:52:17,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:17,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:17,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:17,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:17,833 INFO L87 Difference]: Start difference. First operand 23702 states and 70494 transitions. Second operand 7 states. [2019-12-18 16:52:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:18,677 INFO L93 Difference]: Finished difference Result 32787 states and 97475 transitions. [2019-12-18 16:52:18,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:52:18,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:52:18,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:18,720 INFO L225 Difference]: With dead ends: 32787 [2019-12-18 16:52:18,721 INFO L226 Difference]: Without dead ends: 32787 [2019-12-18 16:52:18,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:52:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32787 states. [2019-12-18 16:52:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32787 to 23660. [2019-12-18 16:52:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23660 states. [2019-12-18 16:52:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23660 states to 23660 states and 70388 transitions. [2019-12-18 16:52:19,156 INFO L78 Accepts]: Start accepts. Automaton has 23660 states and 70388 transitions. Word has length 64 [2019-12-18 16:52:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:19,156 INFO L462 AbstractCegarLoop]: Abstraction has 23660 states and 70388 transitions. [2019-12-18 16:52:19,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 23660 states and 70388 transitions. [2019-12-18 16:52:19,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:19,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:19,183 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] [2019-12-18 16:52:19,183 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-18 16:52:19,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:19,183 INFO L82 PathProgramCache]: Analyzing trace with hash 130546237, now seen corresponding path program 10 times [2019-12-18 16:52:19,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:19,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926755217] [2019-12-18 16:52:19,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:19,263 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-18 16:52:19,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926755217] [2019-12-18 16:52:19,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:19,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:52:19,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702187707] [2019-12-18 16:52:19,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:52:19,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:19,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:52:19,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:52:19,266 INFO L87 Difference]: Start difference. First operand 23660 states and 70388 transitions. Second operand 6 states. [2019-12-18 16:52:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:19,889 INFO L93 Difference]: Finished difference Result 39906 states and 117393 transitions. [2019-12-18 16:52:19,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:52:19,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 16:52:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:19,950 INFO L225 Difference]: With dead ends: 39906 [2019-12-18 16:52:19,950 INFO L226 Difference]: Without dead ends: 39906 [2019-12-18 16:52:19,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:52:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39906 states. [2019-12-18 16:52:20,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39906 to 25943. [2019-12-18 16:52:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25943 states. [2019-12-18 16:52:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25943 states to 25943 states and 77260 transitions. [2019-12-18 16:52:20,707 INFO L78 Accepts]: Start accepts. Automaton has 25943 states and 77260 transitions. Word has length 64 [2019-12-18 16:52:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:20,707 INFO L462 AbstractCegarLoop]: Abstraction has 25943 states and 77260 transitions. [2019-12-18 16:52:20,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:52:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 25943 states and 77260 transitions. [2019-12-18 16:52:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:20,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:20,733 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] [2019-12-18 16:52:20,734 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-18 16:52:20,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:20,734 INFO L82 PathProgramCache]: Analyzing trace with hash -789321411, now seen corresponding path program 11 times [2019-12-18 16:52:20,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:20,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974826793] [2019-12-18 16:52:20,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:20,833 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-18 16:52:20,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974826793] [2019-12-18 16:52:20,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:20,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:52:20,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035471675] [2019-12-18 16:52:20,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:20,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:20,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:20,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:20,836 INFO L87 Difference]: Start difference. First operand 25943 states and 77260 transitions. Second operand 7 states. [2019-12-18 16:52:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:21,578 INFO L93 Difference]: Finished difference Result 39554 states and 116390 transitions. [2019-12-18 16:52:21,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:52:21,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:52:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:21,630 INFO L225 Difference]: With dead ends: 39554 [2019-12-18 16:52:21,630 INFO L226 Difference]: Without dead ends: 39554 [2019-12-18 16:52:21,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:52:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39554 states. [2019-12-18 16:52:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39554 to 24422. [2019-12-18 16:52:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24422 states. [2019-12-18 16:52:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24422 states to 24422 states and 72832 transitions. [2019-12-18 16:52:22,109 INFO L78 Accepts]: Start accepts. Automaton has 24422 states and 72832 transitions. Word has length 64 [2019-12-18 16:52:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:22,109 INFO L462 AbstractCegarLoop]: Abstraction has 24422 states and 72832 transitions. [2019-12-18 16:52:22,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 24422 states and 72832 transitions. [2019-12-18 16:52:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:22,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:22,138 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] [2019-12-18 16:52:22,138 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-18 16:52:22,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:22,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1935640731, now seen corresponding path program 12 times [2019-12-18 16:52:22,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:22,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996425423] [2019-12-18 16:52:22,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:22,256 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-18 16:52:22,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996425423] [2019-12-18 16:52:22,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:22,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:52:22,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785971065] [2019-12-18 16:52:22,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:22,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:22,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:22,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:22,258 INFO L87 Difference]: Start difference. First operand 24422 states and 72832 transitions. Second operand 7 states. [2019-12-18 16:52:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:23,210 INFO L93 Difference]: Finished difference Result 29876 states and 87811 transitions. [2019-12-18 16:52:23,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 16:52:23,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:52:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:23,265 INFO L225 Difference]: With dead ends: 29876 [2019-12-18 16:52:23,265 INFO L226 Difference]: Without dead ends: 29636 [2019-12-18 16:52:23,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:52:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29636 states. [2019-12-18 16:52:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29636 to 25232. [2019-12-18 16:52:23,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25232 states. [2019-12-18 16:52:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25232 states to 25232 states and 75139 transitions. [2019-12-18 16:52:24,036 INFO L78 Accepts]: Start accepts. Automaton has 25232 states and 75139 transitions. Word has length 64 [2019-12-18 16:52:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:24,036 INFO L462 AbstractCegarLoop]: Abstraction has 25232 states and 75139 transitions. [2019-12-18 16:52:24,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 25232 states and 75139 transitions. [2019-12-18 16:52:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:52:24,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:24,076 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] [2019-12-18 16:52:24,076 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-18 16:52:24,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:24,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1015773083, now seen corresponding path program 13 times [2019-12-18 16:52:24,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:24,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624927888] [2019-12-18 16:52:24,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:24,136 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-18 16:52:24,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624927888] [2019-12-18 16:52:24,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:24,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:52:24,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346952004] [2019-12-18 16:52:24,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:52:24,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:24,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:52:24,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:24,138 INFO L87 Difference]: Start difference. First operand 25232 states and 75139 transitions. Second operand 3 states. [2019-12-18 16:52:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:24,246 INFO L93 Difference]: Finished difference Result 25232 states and 75138 transitions. [2019-12-18 16:52:24,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:52:24,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:52:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:24,293 INFO L225 Difference]: With dead ends: 25232 [2019-12-18 16:52:24,293 INFO L226 Difference]: Without dead ends: 25232 [2019-12-18 16:52:24,293 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-18 16:52:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25232 states. [2019-12-18 16:52:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25232 to 21405. [2019-12-18 16:52:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21405 states. [2019-12-18 16:52:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21405 states to 21405 states and 64282 transitions. [2019-12-18 16:52:24,686 INFO L78 Accepts]: Start accepts. Automaton has 21405 states and 64282 transitions. Word has length 64 [2019-12-18 16:52:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:24,687 INFO L462 AbstractCegarLoop]: Abstraction has 21405 states and 64282 transitions. [2019-12-18 16:52:24,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:52:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21405 states and 64282 transitions. [2019-12-18 16:52:24,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:52:24,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:24,709 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-18 16:52:24,710 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-18 16:52:24,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:24,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2117464962, now seen corresponding path program 1 times [2019-12-18 16:52:24,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:24,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547422497] [2019-12-18 16:52:24,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:24,774 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-18 16:52:24,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547422497] [2019-12-18 16:52:24,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:24,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:52:24,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745275690] [2019-12-18 16:52:24,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:52:24,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:24,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:52:24,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:24,776 INFO L87 Difference]: Start difference. First operand 21405 states and 64282 transitions. Second operand 3 states. [2019-12-18 16:52:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:24,949 INFO L93 Difference]: Finished difference Result 24051 states and 72562 transitions. [2019-12-18 16:52:24,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:52:24,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 16:52:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:25,004 INFO L225 Difference]: With dead ends: 24051 [2019-12-18 16:52:25,004 INFO L226 Difference]: Without dead ends: 24051 [2019-12-18 16:52:25,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24051 states. [2019-12-18 16:52:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24051 to 19752. [2019-12-18 16:52:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19752 states. [2019-12-18 16:52:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19752 states to 19752 states and 60057 transitions. [2019-12-18 16:52:25,545 INFO L78 Accepts]: Start accepts. Automaton has 19752 states and 60057 transitions. Word has length 65 [2019-12-18 16:52:25,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:25,546 INFO L462 AbstractCegarLoop]: Abstraction has 19752 states and 60057 transitions. [2019-12-18 16:52:25,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:52:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 19752 states and 60057 transitions. [2019-12-18 16:52:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:52:25,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:25,585 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-18 16:52:25,585 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-18 16:52:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:25,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1762644533, now seen corresponding path program 1 times [2019-12-18 16:52:25,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:25,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927512599] [2019-12-18 16:52:25,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:25,765 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-18 16:52:25,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927512599] [2019-12-18 16:52:25,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:25,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:52:25,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512578099] [2019-12-18 16:52:25,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:25,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:25,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:25,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:25,767 INFO L87 Difference]: Start difference. First operand 19752 states and 60057 transitions. Second operand 7 states. [2019-12-18 16:52:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:26,148 INFO L93 Difference]: Finished difference Result 18018 states and 53956 transitions. [2019-12-18 16:52:26,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:52:26,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 16:52:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:26,183 INFO L225 Difference]: With dead ends: 18018 [2019-12-18 16:52:26,183 INFO L226 Difference]: Without dead ends: 18006 [2019-12-18 16:52:26,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:52:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18006 states. [2019-12-18 16:52:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18006 to 17349. [2019-12-18 16:52:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17349 states. [2019-12-18 16:52:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17349 states to 17349 states and 52052 transitions. [2019-12-18 16:52:26,699 INFO L78 Accepts]: Start accepts. Automaton has 17349 states and 52052 transitions. Word has length 66 [2019-12-18 16:52:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:26,699 INFO L462 AbstractCegarLoop]: Abstraction has 17349 states and 52052 transitions. [2019-12-18 16:52:26,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 17349 states and 52052 transitions. [2019-12-18 16:52:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:52:26,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:26,718 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-18 16:52:26,719 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-18 16:52:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1274043532, now seen corresponding path program 1 times [2019-12-18 16:52:26,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:26,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789021625] [2019-12-18 16:52:26,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:26,824 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-18 16:52:26,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789021625] [2019-12-18 16:52:26,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:26,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:52:26,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596468930] [2019-12-18 16:52:26,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:52:26,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:26,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:52:26,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:52:26,826 INFO L87 Difference]: Start difference. First operand 17349 states and 52052 transitions. Second operand 9 states. [2019-12-18 16:52:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:27,658 INFO L93 Difference]: Finished difference Result 33880 states and 100575 transitions. [2019-12-18 16:52:27,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:52:27,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 16:52:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:27,696 INFO L225 Difference]: With dead ends: 33880 [2019-12-18 16:52:27,697 INFO L226 Difference]: Without dead ends: 28768 [2019-12-18 16:52:27,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 16:52:27,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28768 states. [2019-12-18 16:52:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28768 to 16755. [2019-12-18 16:52:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16755 states. [2019-12-18 16:52:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16755 states to 16755 states and 50135 transitions. [2019-12-18 16:52:28,037 INFO L78 Accepts]: Start accepts. Automaton has 16755 states and 50135 transitions. Word has length 66 [2019-12-18 16:52:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:28,037 INFO L462 AbstractCegarLoop]: Abstraction has 16755 states and 50135 transitions. [2019-12-18 16:52:28,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:52:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 16755 states and 50135 transitions. [2019-12-18 16:52:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:52:28,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:28,055 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-18 16:52:28,055 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-18 16:52:28,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:28,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2132337632, now seen corresponding path program 2 times [2019-12-18 16:52:28,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:28,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792338520] [2019-12-18 16:52:28,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:28,167 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-18 16:52:28,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792338520] [2019-12-18 16:52:28,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:28,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:52:28,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895154064] [2019-12-18 16:52:28,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:52:28,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:28,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:52:28,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:52:28,169 INFO L87 Difference]: Start difference. First operand 16755 states and 50135 transitions. Second operand 9 states. [2019-12-18 16:52:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:29,153 INFO L93 Difference]: Finished difference Result 35263 states and 104247 transitions. [2019-12-18 16:52:29,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:52:29,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 16:52:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:29,191 INFO L225 Difference]: With dead ends: 35263 [2019-12-18 16:52:29,191 INFO L226 Difference]: Without dead ends: 30343 [2019-12-18 16:52:29,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-18 16:52:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30343 states. [2019-12-18 16:52:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30343 to 16592. [2019-12-18 16:52:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16592 states. [2019-12-18 16:52:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16592 states to 16592 states and 49602 transitions. [2019-12-18 16:52:29,524 INFO L78 Accepts]: Start accepts. Automaton has 16592 states and 49602 transitions. Word has length 66 [2019-12-18 16:52:29,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:29,525 INFO L462 AbstractCegarLoop]: Abstraction has 16592 states and 49602 transitions. [2019-12-18 16:52:29,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:52:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 16592 states and 49602 transitions. [2019-12-18 16:52:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:52:29,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:29,541 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-18 16:52:29,541 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-18 16:52:29,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:29,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779120, now seen corresponding path program 1 times [2019-12-18 16:52:29,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:29,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120163338] [2019-12-18 16:52:29,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:29,600 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-18 16:52:29,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120163338] [2019-12-18 16:52:29,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:29,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:52:29,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424971763] [2019-12-18 16:52:29,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:52:29,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:29,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:52:29,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:29,602 INFO L87 Difference]: Start difference. First operand 16592 states and 49602 transitions. Second operand 3 states. [2019-12-18 16:52:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:29,649 INFO L93 Difference]: Finished difference Result 12120 states and 35874 transitions. [2019-12-18 16:52:29,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:52:29,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 16:52:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:29,671 INFO L225 Difference]: With dead ends: 12120 [2019-12-18 16:52:29,671 INFO L226 Difference]: Without dead ends: 12120 [2019-12-18 16:52:29,671 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-18 16:52:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12120 states. [2019-12-18 16:52:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12120 to 11763. [2019-12-18 16:52:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11763 states. [2019-12-18 16:52:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11763 states to 11763 states and 34841 transitions. [2019-12-18 16:52:30,007 INFO L78 Accepts]: Start accepts. Automaton has 11763 states and 34841 transitions. Word has length 66 [2019-12-18 16:52:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:30,008 INFO L462 AbstractCegarLoop]: Abstraction has 11763 states and 34841 transitions. [2019-12-18 16:52:30,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:52:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 11763 states and 34841 transitions. [2019-12-18 16:52:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:52:30,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:30,269 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-18 16:52:30,269 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-18 16:52:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash -171582022, now seen corresponding path program 1 times [2019-12-18 16:52:30,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:30,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690528754] [2019-12-18 16:52:30,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:30,375 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-18 16:52:30,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690528754] [2019-12-18 16:52:30,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:30,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:52:30,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123958952] [2019-12-18 16:52:30,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:52:30,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:30,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:52:30,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:52:30,378 INFO L87 Difference]: Start difference. First operand 11763 states and 34841 transitions. Second operand 8 states. [2019-12-18 16:52:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:31,209 INFO L93 Difference]: Finished difference Result 20812 states and 60910 transitions. [2019-12-18 16:52:31,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 16:52:31,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-18 16:52:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:31,234 INFO L225 Difference]: With dead ends: 20812 [2019-12-18 16:52:31,234 INFO L226 Difference]: Without dead ends: 15528 [2019-12-18 16:52:31,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:52:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15528 states. [2019-12-18 16:52:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15528 to 12194. [2019-12-18 16:52:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12194 states. [2019-12-18 16:52:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12194 states to 12194 states and 35783 transitions. [2019-12-18 16:52:31,517 INFO L78 Accepts]: Start accepts. Automaton has 12194 states and 35783 transitions. Word has length 67 [2019-12-18 16:52:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:31,518 INFO L462 AbstractCegarLoop]: Abstraction has 12194 states and 35783 transitions. [2019-12-18 16:52:31,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:52:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 12194 states and 35783 transitions. [2019-12-18 16:52:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:52:31,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:31,530 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-18 16:52:31,530 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-18 16:52:31,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:31,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1425975690, now seen corresponding path program 2 times [2019-12-18 16:52:31,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:31,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840608834] [2019-12-18 16:52:31,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:31,629 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-18 16:52:31,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840608834] [2019-12-18 16:52:31,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:31,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:52:31,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975971046] [2019-12-18 16:52:31,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:52:31,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:31,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:52:31,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:52:31,631 INFO L87 Difference]: Start difference. First operand 12194 states and 35783 transitions. Second operand 9 states. [2019-12-18 16:52:32,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:32,402 INFO L93 Difference]: Finished difference Result 19979 states and 58144 transitions. [2019-12-18 16:52:32,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:52:32,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 16:52:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:32,422 INFO L225 Difference]: With dead ends: 19979 [2019-12-18 16:52:32,422 INFO L226 Difference]: Without dead ends: 14651 [2019-12-18 16:52:32,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:52:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14651 states. [2019-12-18 16:52:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14651 to 12042. [2019-12-18 16:52:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12042 states. [2019-12-18 16:52:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12042 states to 12042 states and 35317 transitions. [2019-12-18 16:52:32,600 INFO L78 Accepts]: Start accepts. Automaton has 12042 states and 35317 transitions. Word has length 67 [2019-12-18 16:52:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:32,600 INFO L462 AbstractCegarLoop]: Abstraction has 12042 states and 35317 transitions. [2019-12-18 16:52:32,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:52:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 12042 states and 35317 transitions. [2019-12-18 16:52:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:52:32,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:32,612 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-18 16:52:32,612 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-18 16:52:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:32,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1279627604, now seen corresponding path program 3 times [2019-12-18 16:52:32,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:32,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216497139] [2019-12-18 16:52:32,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:32,746 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-18 16:52:32,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216497139] [2019-12-18 16:52:32,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:32,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:52:32,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291959702] [2019-12-18 16:52:32,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:52:32,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:32,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:52:32,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:52:32,748 INFO L87 Difference]: Start difference. First operand 12042 states and 35317 transitions. Second operand 10 states. [2019-12-18 16:52:33,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:33,468 INFO L93 Difference]: Finished difference Result 18857 states and 54710 transitions. [2019-12-18 16:52:33,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:52:33,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 16:52:33,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:33,489 INFO L225 Difference]: With dead ends: 18857 [2019-12-18 16:52:33,489 INFO L226 Difference]: Without dead ends: 15105 [2019-12-18 16:52:33,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-18 16:52:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15105 states. [2019-12-18 16:52:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15105 to 12058. [2019-12-18 16:52:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12058 states. [2019-12-18 16:52:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12058 states to 12058 states and 35311 transitions. [2019-12-18 16:52:33,683 INFO L78 Accepts]: Start accepts. Automaton has 12058 states and 35311 transitions. Word has length 67 [2019-12-18 16:52:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:33,683 INFO L462 AbstractCegarLoop]: Abstraction has 12058 states and 35311 transitions. [2019-12-18 16:52:33,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:52:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 12058 states and 35311 transitions. [2019-12-18 16:52:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:52:33,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:33,696 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-18 16:52:33,696 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:52:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1642000384, now seen corresponding path program 4 times [2019-12-18 16:52:33,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:33,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483209895] [2019-12-18 16:52:33,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:33,851 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-18 16:52:33,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483209895] [2019-12-18 16:52:33,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:33,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:52:33,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242917542] [2019-12-18 16:52:33,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:52:33,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:33,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:52:33,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:52:33,852 INFO L87 Difference]: Start difference. First operand 12058 states and 35311 transitions. Second operand 11 states. [2019-12-18 16:52:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:34,614 INFO L93 Difference]: Finished difference Result 17932 states and 52119 transitions. [2019-12-18 16:52:34,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 16:52:34,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 16:52:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:34,633 INFO L225 Difference]: With dead ends: 17932 [2019-12-18 16:52:34,633 INFO L226 Difference]: Without dead ends: 14248 [2019-12-18 16:52:34,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-18 16:52:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14248 states. [2019-12-18 16:52:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14248 to 11676. [2019-12-18 16:52:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11676 states. [2019-12-18 16:52:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11676 states to 11676 states and 34239 transitions. [2019-12-18 16:52:35,018 INFO L78 Accepts]: Start accepts. Automaton has 11676 states and 34239 transitions. Word has length 67 [2019-12-18 16:52:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:35,018 INFO L462 AbstractCegarLoop]: Abstraction has 11676 states and 34239 transitions. [2019-12-18 16:52:35,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:52:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 11676 states and 34239 transitions. [2019-12-18 16:52:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:52:35,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:35,029 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-18 16:52:35,029 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:52:35,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:35,029 INFO L82 PathProgramCache]: Analyzing trace with hash 8609018, now seen corresponding path program 5 times [2019-12-18 16:52:35,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:35,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705248740] [2019-12-18 16:52:35,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:35,211 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-18 16:52:35,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705248740] [2019-12-18 16:52:35,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:35,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:52:35,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450287341] [2019-12-18 16:52:35,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:52:35,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:35,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:52:35,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:52:35,213 INFO L87 Difference]: Start difference. First operand 11676 states and 34239 transitions. Second operand 12 states. [2019-12-18 16:52:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:35,931 INFO L93 Difference]: Finished difference Result 14419 states and 41989 transitions. [2019-12-18 16:52:35,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:52:35,931 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 16:52:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:35,951 INFO L225 Difference]: With dead ends: 14419 [2019-12-18 16:52:35,951 INFO L226 Difference]: Without dead ends: 13978 [2019-12-18 16:52:35,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 16:52:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13978 states. [2019-12-18 16:52:36,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13978 to 11422. [2019-12-18 16:52:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11422 states. [2019-12-18 16:52:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11422 states to 11422 states and 33595 transitions. [2019-12-18 16:52:36,136 INFO L78 Accepts]: Start accepts. Automaton has 11422 states and 33595 transitions. Word has length 67 [2019-12-18 16:52:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:36,137 INFO L462 AbstractCegarLoop]: Abstraction has 11422 states and 33595 transitions. [2019-12-18 16:52:36,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:52:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 11422 states and 33595 transitions. [2019-12-18 16:52:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:52:36,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:36,152 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-18 16:52:36,152 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:52:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:36,153 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 6 times [2019-12-18 16:52:36,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:36,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239988060] [2019-12-18 16:52:36,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:52:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:52:36,288 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:52:36,289 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:52:36,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= 0 v_~weak$$choice0~0_14) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t654~0.base_24|)) (= |v_#NULL.offset_6| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t654~0.base_24| 4)) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (= |v_ULTIMATE.start_main_~#t654~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (= v_~main$tmp_guard1~0_29 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t654~0.base_24|) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (= 0 |v_#NULL.base_6|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= (store .cse0 |v_ULTIMATE.start_main_~#t654~0.base_24| 1) |v_#valid_63|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t654~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t654~0.base_24|) |v_ULTIMATE.start_main_~#t654~0.offset_19| 0))) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= v_~a$r_buff1_thd3~0_297 0) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t655~0.offset=|v_ULTIMATE.start_main_~#t655~0.offset_19|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ULTIMATE.start_main_~#t656~0.base=|v_ULTIMATE.start_main_~#t656~0.base_27|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ULTIMATE.start_main_~#t656~0.offset=|v_ULTIMATE.start_main_~#t656~0.offset_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_88, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_~#t654~0.base=|v_ULTIMATE.start_main_~#t654~0.base_24|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ULTIMATE.start_main_~#t654~0.offset=|v_ULTIMATE.start_main_~#t654~0.offset_19|, ~y~0=v_~y~0_39, ULTIMATE.start_main_~#t655~0.base=|v_ULTIMATE.start_main_~#t655~0.base_26|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t655~0.offset, ~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, ULTIMATE.start_main_~#t656~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t656~0.offset, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t654~0.base, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t654~0.offset, ~y~0, ULTIMATE.start_main_~#t655~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 16:52:36,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t655~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t655~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t655~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t655~0.base_10|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t655~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t655~0.base_10|) |v_ULTIMATE.start_main_~#t655~0.offset_9| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t655~0.base_10| 4) |v_#length_17|) (= 0 |v_ULTIMATE.start_main_~#t655~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t655~0.base=|v_ULTIMATE.start_main_~#t655~0.base_10|, ULTIMATE.start_main_~#t655~0.offset=|v_ULTIMATE.start_main_~#t655~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t655~0.base, ULTIMATE.start_main_~#t655~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 16:52:36,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t656~0.base_13| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t656~0.base_13|) (= |v_ULTIMATE.start_main_~#t656~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t656~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t656~0.base_13|) |v_ULTIMATE.start_main_~#t656~0.offset_11| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t656~0.base_13|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t656~0.base_13|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t656~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t656~0.base=|v_ULTIMATE.start_main_~#t656~0.base_13|, ULTIMATE.start_main_~#t656~0.offset=|v_ULTIMATE.start_main_~#t656~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t656~0.base, ULTIMATE.start_main_~#t656~0.offset, #length] because there is no mapped edge [2019-12-18 16:52:36,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 16:52:36,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In107506746 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In107506746 256)))) (or (and (or .cse0 .cse1) (= ~a~0_In107506746 |P1Thread1of1ForFork2_#t~ite9_Out107506746|)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out107506746| ~a$w_buff1~0_In107506746) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In107506746, ~a$w_buff1~0=~a$w_buff1~0_In107506746, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In107506746, ~a$w_buff1_used~0=~a$w_buff1_used~0_In107506746} OutVars{~a~0=~a~0_In107506746, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out107506746|, ~a$w_buff1~0=~a$w_buff1~0_In107506746, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In107506746, ~a$w_buff1_used~0=~a$w_buff1_used~0_In107506746} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 16:52:36,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1207337368 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1207337368 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out1207337368| 0) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In1207337368 |P0Thread1of1ForFork1_#t~ite5_Out1207337368|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1207337368, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1207337368} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1207337368|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1207337368, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1207337368} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 16:52:36,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-441939077 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-441939077 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-441939077 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-441939077 256)))) (or (and (= ~a$w_buff1_used~0_In-441939077 |P0Thread1of1ForFork1_#t~ite6_Out-441939077|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-441939077|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-441939077, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-441939077, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-441939077, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-441939077} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-441939077|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-441939077, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-441939077, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-441939077, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-441939077} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 16:52:36,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-9452377 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-9452377 256)))) (or (and (= ~a$r_buff0_thd1~0_In-9452377 ~a$r_buff0_thd1~0_Out-9452377) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-9452377) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-9452377, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-9452377} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-9452377|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-9452377, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-9452377} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:52:36,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-644775647 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-644775647 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-644775647 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-644775647 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd1~0_In-644775647 |P0Thread1of1ForFork1_#t~ite8_Out-644775647|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-644775647|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-644775647, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-644775647, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-644775647, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-644775647} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-644775647|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-644775647, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-644775647, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-644775647, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-644775647} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 16:52:36,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} 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-18 16:52:36,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In197365124 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out197365124| ~a$w_buff0~0_In197365124) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In197365124 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In197365124 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In197365124 256)) .cse1) (and (= 0 (mod ~a$w_buff1_used~0_In197365124 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite20_Out197365124| |P2Thread1of1ForFork0_#t~ite21_Out197365124|)) (and (not .cse0) (= ~a$w_buff0~0_In197365124 |P2Thread1of1ForFork0_#t~ite21_Out197365124|) (= |P2Thread1of1ForFork0_#t~ite20_In197365124| |P2Thread1of1ForFork0_#t~ite20_Out197365124|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In197365124, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In197365124, ~a$w_buff0_used~0=~a$w_buff0_used~0_In197365124, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In197365124, ~a$w_buff1_used~0=~a$w_buff1_used~0_In197365124, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In197365124|, ~weak$$choice2~0=~weak$$choice2~0_In197365124} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out197365124|, ~a$w_buff0~0=~a$w_buff0~0_In197365124, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In197365124, ~a$w_buff0_used~0=~a$w_buff0_used~0_In197365124, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In197365124, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out197365124|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In197365124, ~weak$$choice2~0=~weak$$choice2~0_In197365124} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 16:52:36,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1468973719 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1468973719 256)))) (or (and (= (mod ~a$r_buff1_thd3~0_In1468973719 256) 0) .cse0) (and (= 0 (mod ~a$w_buff1_used~0_In1468973719 256)) .cse0) (= 0 (mod ~a$w_buff0_used~0_In1468973719 256)))) (= |P2Thread1of1ForFork0_#t~ite27_Out1468973719| |P2Thread1of1ForFork0_#t~ite26_Out1468973719|) (= ~a$w_buff0_used~0_In1468973719 |P2Thread1of1ForFork0_#t~ite26_Out1468973719|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite27_Out1468973719| ~a$w_buff0_used~0_In1468973719) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In1468973719| |P2Thread1of1ForFork0_#t~ite26_Out1468973719|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1468973719|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1468973719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468973719, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1468973719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1468973719, ~weak$$choice2~0=~weak$$choice2~0_In1468973719} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1468973719|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1468973719|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1468973719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468973719, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1468973719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1468973719, ~weak$$choice2~0=~weak$$choice2~0_In1468973719} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 16:52:36,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1455811825 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1455811825 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-1455811825 256)) .cse1) (= (mod ~a$w_buff0_used~0_In-1455811825 256) 0) (and (= (mod ~a$r_buff1_thd3~0_In-1455811825 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite29_Out-1455811825| |P2Thread1of1ForFork0_#t~ite30_Out-1455811825|) (= |P2Thread1of1ForFork0_#t~ite29_Out-1455811825| ~a$w_buff1_used~0_In-1455811825)) (and (= |P2Thread1of1ForFork0_#t~ite29_In-1455811825| |P2Thread1of1ForFork0_#t~ite29_Out-1455811825|) (= |P2Thread1of1ForFork0_#t~ite30_Out-1455811825| ~a$w_buff1_used~0_In-1455811825) (not .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1455811825, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1455811825, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1455811825, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1455811825, ~weak$$choice2~0=~weak$$choice2~0_In-1455811825, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1455811825|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1455811825, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1455811825, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1455811825, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1455811825|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1455811825, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1455811825|, ~weak$$choice2~0=~weak$$choice2~0_In-1455811825} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:52:36,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~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-18 16:52:36,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 16:52:36,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-972330447 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-972330447 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-972330447| ~a$w_buff0_used~0_In-972330447)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-972330447| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-972330447, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-972330447} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-972330447, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-972330447, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-972330447|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:52:36,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1544641876 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1544641876 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1544641876 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1544641876 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-1544641876| ~a$w_buff1_used~0_In-1544641876)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1544641876|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1544641876, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1544641876, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1544641876, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1544641876} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1544641876, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1544641876, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1544641876, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1544641876|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1544641876} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 16:52:36,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1247469577 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1247469577 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1247469577 |P1Thread1of1ForFork2_#t~ite13_Out-1247469577|)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1247469577| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1247469577, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1247469577} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1247469577, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1247469577, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1247469577|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 16:52:36,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1538388237 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1538388237 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1538388237 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1538388237 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In-1538388237 |P1Thread1of1ForFork2_#t~ite14_Out-1538388237|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1538388237|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1538388237, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1538388237, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1538388237, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1538388237} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1538388237, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1538388237, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1538388237, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1538388237, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1538388237|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:52:36,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, 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-18 16:52:36,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 16:52:36,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1900357683| |P2Thread1of1ForFork0_#t~ite39_Out1900357683|)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1900357683 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1900357683 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1900357683| ~a$w_buff1~0_In1900357683) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out1900357683| ~a~0_In1900357683)))) InVars {~a~0=~a~0_In1900357683, ~a$w_buff1~0=~a$w_buff1~0_In1900357683, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1900357683, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1900357683} OutVars{~a~0=~a~0_In1900357683, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1900357683|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1900357683|, ~a$w_buff1~0=~a$w_buff1~0_In1900357683, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1900357683, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1900357683} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:52:36,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In410428410 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In410428410 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out410428410|)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In410428410 |P2Thread1of1ForFork0_#t~ite40_Out410428410|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In410428410, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In410428410} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out410428410|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In410428410, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In410428410} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 16:52:36,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-983695427 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-983695427 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-983695427 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-983695427 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-983695427 |P2Thread1of1ForFork0_#t~ite41_Out-983695427|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-983695427|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-983695427, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-983695427, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-983695427, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-983695427} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-983695427, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-983695427, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-983695427, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-983695427, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-983695427|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 16:52:36,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-72141566 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-72141566 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-72141566| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-72141566| ~a$r_buff0_thd3~0_In-72141566) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-72141566, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-72141566} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-72141566, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-72141566, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-72141566|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:52:36,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In576705311 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In576705311 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In576705311 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In576705311 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In576705311 |P2Thread1of1ForFork0_#t~ite43_Out576705311|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out576705311|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In576705311, ~a$w_buff0_used~0=~a$w_buff0_used~0_In576705311, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In576705311, ~a$w_buff1_used~0=~a$w_buff1_used~0_In576705311} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out576705311|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In576705311, ~a$w_buff0_used~0=~a$w_buff0_used~0_In576705311, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In576705311, ~a$w_buff1_used~0=~a$w_buff1_used~0_In576705311} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 16:52:36,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, 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-18 16:52:36,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:52:36,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In829796861 256))) (.cse1 (= (mod ~a$r_buff1_thd0~0_In829796861 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out829796861| |ULTIMATE.start_main_#t~ite48_Out829796861|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out829796861| ~a~0_In829796861) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out829796861| ~a$w_buff1~0_In829796861) (not .cse1) .cse2))) InVars {~a~0=~a~0_In829796861, ~a$w_buff1~0=~a$w_buff1~0_In829796861, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In829796861, ~a$w_buff1_used~0=~a$w_buff1_used~0_In829796861} OutVars{~a~0=~a~0_In829796861, ~a$w_buff1~0=~a$w_buff1~0_In829796861, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out829796861|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In829796861, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out829796861|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In829796861} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 16:52:36,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-483354778 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-483354778 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-483354778|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-483354778 |ULTIMATE.start_main_#t~ite49_Out-483354778|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-483354778, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-483354778} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-483354778, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-483354778|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-483354778} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 16:52:36,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-377637156 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-377637156 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-377637156 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-377637156 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-377637156| 0)) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-377637156 |ULTIMATE.start_main_#t~ite50_Out-377637156|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-377637156, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-377637156, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-377637156, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-377637156} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-377637156|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-377637156, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-377637156, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-377637156, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-377637156} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 16:52:36,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-857659703 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-857659703 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-857659703|)) (and (= ~a$r_buff0_thd0~0_In-857659703 |ULTIMATE.start_main_#t~ite51_Out-857659703|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-857659703, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-857659703} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-857659703|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-857659703, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-857659703} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 16:52:36,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In2127541406 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In2127541406 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In2127541406 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In2127541406 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In2127541406 |ULTIMATE.start_main_#t~ite52_Out2127541406|)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out2127541406|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2127541406, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2127541406, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2127541406, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2127541406} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2127541406|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2127541406, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2127541406, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2127541406, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2127541406} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 16:52:36,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} 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-18 16:52:36,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:52:36 BasicIcfg [2019-12-18 16:52:36,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:52:36,426 INFO L168 Benchmark]: Toolchain (without parser) took 101275.17 ms. Allocated memory was 139.5 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 16:52:36,426 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 16:52:36,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.59 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 157.3 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:52:36,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.11 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:52:36,427 INFO L168 Benchmark]: Boogie Preprocessor took 45.08 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:52:36,428 INFO L168 Benchmark]: RCFGBuilder took 854.00 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 101.4 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:52:36,428 INFO L168 Benchmark]: TraceAbstraction took 99514.31 ms. Allocated memory was 203.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 16:52:36,430 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.59 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 157.3 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.11 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.08 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.00 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 101.4 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99514.31 ms. Allocated memory was 203.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t654, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L837] FCALL, FORK 0 pthread_create(&t655, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t656, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=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=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L756] 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=1, __unbuffered_p0_EBX=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 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L776] 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=1, __unbuffered_p0_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L756] 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) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L800] 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)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L758] 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 [L800] 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) [L801] 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)) [L802] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=2] [L802] 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)) [L803] 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)) [L804] 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)) [L806] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 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 [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 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)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, 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=9, weak$$choice2=1, x=1, y=1, z=2] [L812] EXPR 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, 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=9, weak$$choice2=1, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 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 [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, 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=9, weak$$choice2=1, x=1, y=1, z=2] [L845] 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) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 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 [L848] 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: 99.1s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 32.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7718 SDtfs, 10927 SDslu, 23823 SDs, 0 SdLazy, 11986 SolverSat, 479 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 97 SyntacticMatches, 22 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred 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: 38.4s AutomataMinimizationTime, 36 MinimizatonAttempts, 206052 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1960 NumberOfCodeBlocks, 1960 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 396842 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...