/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/mix003_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:07:31,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:07:31,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:07:31,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:07:31,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:07:31,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:07:31,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:07:31,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:07:31,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:07:31,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:07:31,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:07:31,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:07:31,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:07:31,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:07:31,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:07:31,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:07:31,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:07:31,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:07:31,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:07:31,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:07:31,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:07:31,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:07:31,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:07:31,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:07:31,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:07:31,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:07:31,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:07:31,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:07:31,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:07:31,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:07:31,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:07:31,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:07:31,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:07:31,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:07:31,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:07:31,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:07:31,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:07:31,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:07:31,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:07:31,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:07:31,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:07:31,879 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-27 01:07:31,906 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:07:31,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:07:31,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:07:31,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:07:31,909 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:07:31,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:07:31,910 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:07:31,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:07:31,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:07:31,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:07:31,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:07:31,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:07:31,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:07:31,912 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:07:31,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:07:31,912 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:07:31,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:07:31,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:07:31,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:07:31,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:07:31,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:07:31,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:07:31,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:07:31,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:07:31,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:07:31,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:07:31,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:07:31,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:07:31,915 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:07:32,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:07:32,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:07:32,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:07:32,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:07:32,198 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:07:32,199 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_rmo.oepc.i [2019-12-27 01:07:32,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8127ee323/3069ebc9c1f044fd812d2034ae422b21/FLAG1269019c0 [2019-12-27 01:07:32,825 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:07:32,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_rmo.oepc.i [2019-12-27 01:07:32,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8127ee323/3069ebc9c1f044fd812d2034ae422b21/FLAG1269019c0 [2019-12-27 01:07:33,134 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8127ee323/3069ebc9c1f044fd812d2034ae422b21 [2019-12-27 01:07:33,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:07:33,147 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:07:33,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:07:33,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:07:33,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:07:33,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:07:33" (1/1) ... [2019-12-27 01:07:33,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1562cfed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33, skipping insertion in model container [2019-12-27 01:07:33,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:07:33" (1/1) ... [2019-12-27 01:07:33,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:07:33,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:07:33,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:07:33,809 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:07:33,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:07:33,974 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:07:33,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33 WrapperNode [2019-12-27 01:07:33,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:07:33,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:07:33,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:07:33,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:07:33,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33" (1/1) ... [2019-12-27 01:07:34,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33" (1/1) ... [2019-12-27 01:07:34,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:07:34,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:07:34,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:07:34,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:07:34,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33" (1/1) ... [2019-12-27 01:07:34,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33" (1/1) ... [2019-12-27 01:07:34,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33" (1/1) ... [2019-12-27 01:07:34,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33" (1/1) ... [2019-12-27 01:07:34,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33" (1/1) ... [2019-12-27 01:07:34,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33" (1/1) ... [2019-12-27 01:07:34,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33" (1/1) ... [2019-12-27 01:07:34,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:07:34,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:07:34,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:07:34,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:07:34,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:07:34,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:07:34,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:07:34,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:07:34,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:07:34,149 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:07:34,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:07:34,150 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:07:34,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:07:34,150 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:07:34,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:07:34,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:07:34,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:07:34,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:07:34,153 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:07:34,909 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:07:34,909 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:07:34,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:07:34 BoogieIcfgContainer [2019-12-27 01:07:34,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:07:34,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:07:34,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:07:34,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:07:34,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:07:33" (1/3) ... [2019-12-27 01:07:34,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bb1b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:07:34, skipping insertion in model container [2019-12-27 01:07:34,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:07:33" (2/3) ... [2019-12-27 01:07:34,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bb1b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:07:34, skipping insertion in model container [2019-12-27 01:07:34,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:07:34" (3/3) ... [2019-12-27 01:07:34,924 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_rmo.oepc.i [2019-12-27 01:07:34,935 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:07:34,936 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:07:34,954 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:07:34,955 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:07:35,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,020 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,020 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,020 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,021 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,021 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,034 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,060 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,060 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,087 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,090 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,097 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,097 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,098 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:07:35,121 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:07:35,141 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:07:35,142 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:07:35,142 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:07:35,142 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:07:35,142 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:07:35,142 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:07:35,142 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:07:35,142 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:07:35,160 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 01:07:35,162 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 01:07:35,274 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 01:07:35,275 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:07:35,295 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 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:07:35,318 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 01:07:35,423 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 01:07:35,423 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:07:35,436 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 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:07:35,460 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:07:35,461 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:07:40,865 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 01:07:41,015 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 01:07:41,387 INFO L206 etLargeBlockEncoding]: Checked pairs total: 132619 [2019-12-27 01:07:41,387 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 01:07:41,391 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 01:08:01,086 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-27 01:08:01,087 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-27 01:08:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:08:01,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:01,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:08:01,094 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash 919842, now seen corresponding path program 1 times [2019-12-27 01:08:01,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:01,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179664771] [2019-12-27 01:08:01,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:01,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179664771] [2019-12-27 01:08:01,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:01,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:08:01,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50554380] [2019-12-27 01:08:01,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:08:01,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:01,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:08:01,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:01,397 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-27 01:08:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:03,171 INFO L93 Difference]: Finished difference Result 119613 states and 515253 transitions. [2019-12-27 01:08:03,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:08:03,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:08:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:03,941 INFO L225 Difference]: With dead ends: 119613 [2019-12-27 01:08:03,942 INFO L226 Difference]: Without dead ends: 105755 [2019-12-27 01:08:03,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105755 states. [2019-12-27 01:08:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105755 to 105755. [2019-12-27 01:08:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105755 states. [2019-12-27 01:08:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105755 states to 105755 states and 454361 transitions. [2019-12-27 01:08:17,633 INFO L78 Accepts]: Start accepts. Automaton has 105755 states and 454361 transitions. Word has length 3 [2019-12-27 01:08:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:17,633 INFO L462 AbstractCegarLoop]: Abstraction has 105755 states and 454361 transitions. [2019-12-27 01:08:17,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:08:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 105755 states and 454361 transitions. [2019-12-27 01:08:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:08:17,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:17,638 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:17,638 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:17,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:17,639 INFO L82 PathProgramCache]: Analyzing trace with hash 474732739, now seen corresponding path program 1 times [2019-12-27 01:08:17,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:17,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672577448] [2019-12-27 01:08:17,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:17,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672577448] [2019-12-27 01:08:17,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:17,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:08:17,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992664278] [2019-12-27 01:08:17,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:08:17,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:17,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:08:17,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:08:17,735 INFO L87 Difference]: Start difference. First operand 105755 states and 454361 transitions. Second operand 4 states. [2019-12-27 01:08:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:23,686 INFO L93 Difference]: Finished difference Result 168845 states and 694815 transitions. [2019-12-27 01:08:23,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:08:23,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:08:23,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:24,343 INFO L225 Difference]: With dead ends: 168845 [2019-12-27 01:08:24,344 INFO L226 Difference]: Without dead ends: 168747 [2019-12-27 01:08:24,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:08:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168747 states. [2019-12-27 01:08:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168747 to 153153. [2019-12-27 01:08:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153153 states. [2019-12-27 01:08:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 639357 transitions. [2019-12-27 01:08:39,398 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 639357 transitions. Word has length 11 [2019-12-27 01:08:39,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:39,399 INFO L462 AbstractCegarLoop]: Abstraction has 153153 states and 639357 transitions. [2019-12-27 01:08:39,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:08:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 639357 transitions. [2019-12-27 01:08:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:08:39,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:39,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:39,406 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:39,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:39,406 INFO L82 PathProgramCache]: Analyzing trace with hash -512415605, now seen corresponding path program 1 times [2019-12-27 01:08:39,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:39,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130374160] [2019-12-27 01:08:39,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:39,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130374160] [2019-12-27 01:08:39,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:39,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:08:39,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011202579] [2019-12-27 01:08:39,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:08:39,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:39,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:08:39,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:39,475 INFO L87 Difference]: Start difference. First operand 153153 states and 639357 transitions. Second operand 3 states. [2019-12-27 01:08:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:39,603 INFO L93 Difference]: Finished difference Result 33476 states and 109893 transitions. [2019-12-27 01:08:39,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:08:39,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:08:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:39,707 INFO L225 Difference]: With dead ends: 33476 [2019-12-27 01:08:39,708 INFO L226 Difference]: Without dead ends: 33476 [2019-12-27 01:08:39,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33476 states. [2019-12-27 01:08:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33476 to 33476. [2019-12-27 01:08:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33476 states. [2019-12-27 01:08:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 109893 transitions. [2019-12-27 01:08:40,370 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 109893 transitions. Word has length 13 [2019-12-27 01:08:40,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:40,370 INFO L462 AbstractCegarLoop]: Abstraction has 33476 states and 109893 transitions. [2019-12-27 01:08:40,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:08:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 109893 transitions. [2019-12-27 01:08:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:08:40,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:40,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:40,374 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:40,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:40,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1719969010, now seen corresponding path program 1 times [2019-12-27 01:08:40,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:40,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054130435] [2019-12-27 01:08:40,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:40,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054130435] [2019-12-27 01:08:40,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:40,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:08:40,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698503629] [2019-12-27 01:08:40,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:08:40,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:40,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:08:40,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:08:40,459 INFO L87 Difference]: Start difference. First operand 33476 states and 109893 transitions. Second operand 4 states. [2019-12-27 01:08:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:40,848 INFO L93 Difference]: Finished difference Result 41508 states and 134890 transitions. [2019-12-27 01:08:40,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:08:40,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:08:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:40,928 INFO L225 Difference]: With dead ends: 41508 [2019-12-27 01:08:40,929 INFO L226 Difference]: Without dead ends: 41508 [2019-12-27 01:08:40,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:08:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41508 states. [2019-12-27 01:08:42,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41508 to 37458. [2019-12-27 01:08:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-27 01:08:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 122375 transitions. [2019-12-27 01:08:42,905 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 122375 transitions. Word has length 16 [2019-12-27 01:08:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:42,906 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 122375 transitions. [2019-12-27 01:08:42,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:08:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 122375 transitions. [2019-12-27 01:08:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:08:42,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:42,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:42,910 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:42,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:42,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1720071868, now seen corresponding path program 1 times [2019-12-27 01:08:42,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:42,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096126925] [2019-12-27 01:08:42,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:42,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096126925] [2019-12-27 01:08:42,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:42,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:08:42,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042438714] [2019-12-27 01:08:42,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:08:42,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:42,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:08:42,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:42,979 INFO L87 Difference]: Start difference. First operand 37458 states and 122375 transitions. Second operand 3 states. [2019-12-27 01:08:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:43,204 INFO L93 Difference]: Finished difference Result 54855 states and 178352 transitions. [2019-12-27 01:08:43,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:08:43,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 01:08:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:43,299 INFO L225 Difference]: With dead ends: 54855 [2019-12-27 01:08:43,300 INFO L226 Difference]: Without dead ends: 54855 [2019-12-27 01:08:43,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54855 states. [2019-12-27 01:08:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54855 to 41888. [2019-12-27 01:08:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-27 01:08:44,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137861 transitions. [2019-12-27 01:08:44,127 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137861 transitions. Word has length 16 [2019-12-27 01:08:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:44,127 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137861 transitions. [2019-12-27 01:08:44,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:08:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137861 transitions. [2019-12-27 01:08:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:08:44,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:44,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:44,132 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:44,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:44,132 INFO L82 PathProgramCache]: Analyzing trace with hash 759335912, now seen corresponding path program 1 times [2019-12-27 01:08:44,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:44,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201482942] [2019-12-27 01:08:44,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:44,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201482942] [2019-12-27 01:08:44,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:44,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:08:44,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673544029] [2019-12-27 01:08:44,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:08:44,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:44,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:08:44,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:08:44,190 INFO L87 Difference]: Start difference. First operand 41888 states and 137861 transitions. Second operand 4 states. [2019-12-27 01:08:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:44,564 INFO L93 Difference]: Finished difference Result 49903 states and 162773 transitions. [2019-12-27 01:08:44,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:08:44,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:08:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:44,649 INFO L225 Difference]: With dead ends: 49903 [2019-12-27 01:08:44,649 INFO L226 Difference]: Without dead ends: 49903 [2019-12-27 01:08:44,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:08:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49903 states. [2019-12-27 01:08:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49903 to 43402. [2019-12-27 01:08:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43402 states. [2019-12-27 01:08:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43402 states to 43402 states and 142861 transitions. [2019-12-27 01:08:46,153 INFO L78 Accepts]: Start accepts. Automaton has 43402 states and 142861 transitions. Word has length 16 [2019-12-27 01:08:46,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:46,153 INFO L462 AbstractCegarLoop]: Abstraction has 43402 states and 142861 transitions. [2019-12-27 01:08:46,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:08:46,154 INFO L276 IsEmpty]: Start isEmpty. Operand 43402 states and 142861 transitions. [2019-12-27 01:08:46,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:08:46,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:46,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:46,163 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:46,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:46,163 INFO L82 PathProgramCache]: Analyzing trace with hash -390431288, now seen corresponding path program 1 times [2019-12-27 01:08:46,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:46,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259456681] [2019-12-27 01:08:46,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:46,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259456681] [2019-12-27 01:08:46,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:46,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:08:46,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176813603] [2019-12-27 01:08:46,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:08:46,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:46,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:08:46,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:08:46,286 INFO L87 Difference]: Start difference. First operand 43402 states and 142861 transitions. Second operand 5 states. [2019-12-27 01:08:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:46,996 INFO L93 Difference]: Finished difference Result 59763 states and 191505 transitions. [2019-12-27 01:08:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:08:46,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:08:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:47,101 INFO L225 Difference]: With dead ends: 59763 [2019-12-27 01:08:47,101 INFO L226 Difference]: Without dead ends: 59749 [2019-12-27 01:08:47,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:08:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59749 states. [2019-12-27 01:08:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59749 to 44536. [2019-12-27 01:08:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44536 states. [2019-12-27 01:08:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44536 states to 44536 states and 146317 transitions. [2019-12-27 01:08:48,921 INFO L78 Accepts]: Start accepts. Automaton has 44536 states and 146317 transitions. Word has length 22 [2019-12-27 01:08:48,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:48,922 INFO L462 AbstractCegarLoop]: Abstraction has 44536 states and 146317 transitions. [2019-12-27 01:08:48,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:08:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 44536 states and 146317 transitions. [2019-12-27 01:08:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:08:48,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:48,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:48,931 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2088873634, now seen corresponding path program 1 times [2019-12-27 01:08:48,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:48,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799638358] [2019-12-27 01:08:48,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:49,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799638358] [2019-12-27 01:08:49,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:49,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:08:49,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795556005] [2019-12-27 01:08:49,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:08:49,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:49,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:08:49,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:08:49,019 INFO L87 Difference]: Start difference. First operand 44536 states and 146317 transitions. Second operand 5 states. [2019-12-27 01:08:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:49,636 INFO L93 Difference]: Finished difference Result 62779 states and 200555 transitions. [2019-12-27 01:08:49,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:08:49,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:08:49,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:49,738 INFO L225 Difference]: With dead ends: 62779 [2019-12-27 01:08:49,739 INFO L226 Difference]: Without dead ends: 62765 [2019-12-27 01:08:49,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:08:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62765 states. [2019-12-27 01:08:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62765 to 43009. [2019-12-27 01:08:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-12-27 01:08:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 141377 transitions. [2019-12-27 01:08:50,610 INFO L78 Accepts]: Start accepts. Automaton has 43009 states and 141377 transitions. Word has length 22 [2019-12-27 01:08:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:50,610 INFO L462 AbstractCegarLoop]: Abstraction has 43009 states and 141377 transitions. [2019-12-27 01:08:50,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:08:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 43009 states and 141377 transitions. [2019-12-27 01:08:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:08:50,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:50,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:50,623 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:50,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:50,623 INFO L82 PathProgramCache]: Analyzing trace with hash -697105977, now seen corresponding path program 1 times [2019-12-27 01:08:50,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:50,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860626334] [2019-12-27 01:08:50,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:50,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860626334] [2019-12-27 01:08:50,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:50,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:08:50,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384762990] [2019-12-27 01:08:50,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:08:50,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:50,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:08:50,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:08:50,680 INFO L87 Difference]: Start difference. First operand 43009 states and 141377 transitions. Second operand 4 states. [2019-12-27 01:08:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:50,760 INFO L93 Difference]: Finished difference Result 17503 states and 54477 transitions. [2019-12-27 01:08:50,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:08:50,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:08:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:50,784 INFO L225 Difference]: With dead ends: 17503 [2019-12-27 01:08:50,785 INFO L226 Difference]: Without dead ends: 17503 [2019-12-27 01:08:50,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:08:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2019-12-27 01:08:51,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 17140. [2019-12-27 01:08:51,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-27 01:08:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 53441 transitions. [2019-12-27 01:08:51,680 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 53441 transitions. Word has length 25 [2019-12-27 01:08:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:51,680 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 53441 transitions. [2019-12-27 01:08:51,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:08:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 53441 transitions. [2019-12-27 01:08:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:08:51,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:51,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:51,694 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:51,694 INFO L82 PathProgramCache]: Analyzing trace with hash 967503752, now seen corresponding path program 1 times [2019-12-27 01:08:51,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:51,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282105661] [2019-12-27 01:08:51,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:51,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282105661] [2019-12-27 01:08:51,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:51,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:08:51,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379108310] [2019-12-27 01:08:51,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:08:51,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:51,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:08:51,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:51,742 INFO L87 Difference]: Start difference. First operand 17140 states and 53441 transitions. Second operand 3 states. [2019-12-27 01:08:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:51,871 INFO L93 Difference]: Finished difference Result 22571 states and 66756 transitions. [2019-12-27 01:08:51,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:08:51,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 01:08:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:51,922 INFO L225 Difference]: With dead ends: 22571 [2019-12-27 01:08:51,923 INFO L226 Difference]: Without dead ends: 22571 [2019-12-27 01:08:51,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22571 states. [2019-12-27 01:08:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22571 to 17140. [2019-12-27 01:08:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-27 01:08:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 51063 transitions. [2019-12-27 01:08:52,380 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 51063 transitions. Word has length 27 [2019-12-27 01:08:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:52,381 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 51063 transitions. [2019-12-27 01:08:52,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:08:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 51063 transitions. [2019-12-27 01:08:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:08:52,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:52,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:52,397 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:52,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:52,398 INFO L82 PathProgramCache]: Analyzing trace with hash 196927527, now seen corresponding path program 1 times [2019-12-27 01:08:52,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:52,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034622984] [2019-12-27 01:08:52,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:52,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034622984] [2019-12-27 01:08:52,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:52,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:08:52,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045947057] [2019-12-27 01:08:52,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:08:52,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:52,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:08:52,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:08:52,455 INFO L87 Difference]: Start difference. First operand 17140 states and 51063 transitions. Second operand 5 states. [2019-12-27 01:08:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:52,821 INFO L93 Difference]: Finished difference Result 21146 states and 62188 transitions. [2019-12-27 01:08:52,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:08:52,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 01:08:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:52,859 INFO L225 Difference]: With dead ends: 21146 [2019-12-27 01:08:52,859 INFO L226 Difference]: Without dead ends: 21146 [2019-12-27 01:08:52,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:08:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21146 states. [2019-12-27 01:08:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21146 to 19815. [2019-12-27 01:08:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19815 states. [2019-12-27 01:08:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19815 states to 19815 states and 58833 transitions. [2019-12-27 01:08:53,156 INFO L78 Accepts]: Start accepts. Automaton has 19815 states and 58833 transitions. Word has length 27 [2019-12-27 01:08:53,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:53,156 INFO L462 AbstractCegarLoop]: Abstraction has 19815 states and 58833 transitions. [2019-12-27 01:08:53,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:08:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 19815 states and 58833 transitions. [2019-12-27 01:08:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:08:53,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:53,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:53,170 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:53,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:53,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1188103809, now seen corresponding path program 1 times [2019-12-27 01:08:53,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:53,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606065470] [2019-12-27 01:08:53,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:53,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606065470] [2019-12-27 01:08:53,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:53,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:08:53,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247355078] [2019-12-27 01:08:53,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:08:53,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:53,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:08:53,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:08:53,231 INFO L87 Difference]: Start difference. First operand 19815 states and 58833 transitions. Second operand 5 states. [2019-12-27 01:08:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:53,678 INFO L93 Difference]: Finished difference Result 23192 states and 68046 transitions. [2019-12-27 01:08:53,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:08:53,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 01:08:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:53,726 INFO L225 Difference]: With dead ends: 23192 [2019-12-27 01:08:53,726 INFO L226 Difference]: Without dead ends: 23192 [2019-12-27 01:08:53,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:08:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2019-12-27 01:08:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 19826. [2019-12-27 01:08:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19826 states. [2019-12-27 01:08:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 58720 transitions. [2019-12-27 01:08:54,679 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 58720 transitions. Word has length 28 [2019-12-27 01:08:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:54,680 INFO L462 AbstractCegarLoop]: Abstraction has 19826 states and 58720 transitions. [2019-12-27 01:08:54,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:08:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 58720 transitions. [2019-12-27 01:08:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:08:54,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:54,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:54,700 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:54,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:54,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1042720045, now seen corresponding path program 1 times [2019-12-27 01:08:54,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:54,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515956551] [2019-12-27 01:08:54,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:54,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-27 01:08:54,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515956551] [2019-12-27 01:08:54,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:54,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:08:54,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849436881] [2019-12-27 01:08:54,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:08:54,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:54,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:08:54,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:08:54,793 INFO L87 Difference]: Start difference. First operand 19826 states and 58720 transitions. Second operand 6 states. [2019-12-27 01:08:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:55,532 INFO L93 Difference]: Finished difference Result 26785 states and 78213 transitions. [2019-12-27 01:08:55,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:08:55,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 01:08:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:55,571 INFO L225 Difference]: With dead ends: 26785 [2019-12-27 01:08:55,571 INFO L226 Difference]: Without dead ends: 26785 [2019-12-27 01:08:55,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:08:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26785 states. [2019-12-27 01:08:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26785 to 20969. [2019-12-27 01:08:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-27 01:08:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 62212 transitions. [2019-12-27 01:08:55,930 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 62212 transitions. Word has length 33 [2019-12-27 01:08:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:55,930 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 62212 transitions. [2019-12-27 01:08:55,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:08:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 62212 transitions. [2019-12-27 01:08:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:08:55,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:55,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:55,952 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:55,952 INFO L82 PathProgramCache]: Analyzing trace with hash -738339527, now seen corresponding path program 1 times [2019-12-27 01:08:55,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:55,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500257122] [2019-12-27 01:08:55,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:56,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500257122] [2019-12-27 01:08:56,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:56,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:08:56,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961220169] [2019-12-27 01:08:56,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:08:56,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:56,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:08:56,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:08:56,045 INFO L87 Difference]: Start difference. First operand 20969 states and 62212 transitions. Second operand 6 states. [2019-12-27 01:08:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:56,788 INFO L93 Difference]: Finished difference Result 25915 states and 75815 transitions. [2019-12-27 01:08:56,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:08:56,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 01:08:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:56,827 INFO L225 Difference]: With dead ends: 25915 [2019-12-27 01:08:56,827 INFO L226 Difference]: Without dead ends: 25915 [2019-12-27 01:08:56,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:08:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25915 states. [2019-12-27 01:08:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25915 to 17954. [2019-12-27 01:08:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2019-12-27 01:08:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 53419 transitions. [2019-12-27 01:08:57,166 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 53419 transitions. Word has length 34 [2019-12-27 01:08:57,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:57,167 INFO L462 AbstractCegarLoop]: Abstraction has 17954 states and 53419 transitions. [2019-12-27 01:08:57,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:08:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 53419 transitions. [2019-12-27 01:08:57,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:08:57,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:57,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:57,187 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:57,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:57,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1814402429, now seen corresponding path program 1 times [2019-12-27 01:08:57,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:57,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662024738] [2019-12-27 01:08:57,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:57,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662024738] [2019-12-27 01:08:57,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:57,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:08:57,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830964987] [2019-12-27 01:08:57,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:08:57,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:57,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:08:57,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:57,246 INFO L87 Difference]: Start difference. First operand 17954 states and 53419 transitions. Second operand 3 states. [2019-12-27 01:08:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:57,312 INFO L93 Difference]: Finished difference Result 17953 states and 53417 transitions. [2019-12-27 01:08:57,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:08:57,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:08:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:57,343 INFO L225 Difference]: With dead ends: 17953 [2019-12-27 01:08:57,343 INFO L226 Difference]: Without dead ends: 17953 [2019-12-27 01:08:57,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-27 01:08:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 17953. [2019-12-27 01:08:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17953 states. [2019-12-27 01:08:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 53417 transitions. [2019-12-27 01:08:58,142 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 53417 transitions. Word has length 39 [2019-12-27 01:08:58,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:58,142 INFO L462 AbstractCegarLoop]: Abstraction has 17953 states and 53417 transitions. [2019-12-27 01:08:58,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:08:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 53417 transitions. [2019-12-27 01:08:58,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:08:58,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:58,159 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:58,159 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:58,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:58,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1557699484, now seen corresponding path program 1 times [2019-12-27 01:08:58,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:58,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121367618] [2019-12-27 01:08:58,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:58,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-27 01:08:58,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121367618] [2019-12-27 01:08:58,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:58,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:08:58,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231410929] [2019-12-27 01:08:58,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:08:58,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:58,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:08:58,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:58,259 INFO L87 Difference]: Start difference. First operand 17953 states and 53417 transitions. Second operand 3 states. [2019-12-27 01:08:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:58,346 INFO L93 Difference]: Finished difference Result 17953 states and 53342 transitions. [2019-12-27 01:08:58,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:08:58,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 01:08:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:58,380 INFO L225 Difference]: With dead ends: 17953 [2019-12-27 01:08:58,380 INFO L226 Difference]: Without dead ends: 17953 [2019-12-27 01:08:58,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-27 01:08:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 16037. [2019-12-27 01:08:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16037 states. [2019-12-27 01:08:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16037 states to 16037 states and 48092 transitions. [2019-12-27 01:08:58,694 INFO L78 Accepts]: Start accepts. Automaton has 16037 states and 48092 transitions. Word has length 40 [2019-12-27 01:08:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:58,694 INFO L462 AbstractCegarLoop]: Abstraction has 16037 states and 48092 transitions. [2019-12-27 01:08:58,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:08:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 16037 states and 48092 transitions. [2019-12-27 01:08:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 01:08:58,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:58,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:58,714 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:58,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:58,715 INFO L82 PathProgramCache]: Analyzing trace with hash -935567252, now seen corresponding path program 1 times [2019-12-27 01:08:58,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:58,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201814696] [2019-12-27 01:08:58,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:58,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201814696] [2019-12-27 01:08:58,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:58,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:08:58,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767685188] [2019-12-27 01:08:58,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:08:58,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:58,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:08:58,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:08:58,775 INFO L87 Difference]: Start difference. First operand 16037 states and 48092 transitions. Second operand 5 states. [2019-12-27 01:08:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:58,851 INFO L93 Difference]: Finished difference Result 14868 states and 45573 transitions. [2019-12-27 01:08:58,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:08:58,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 01:08:58,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:58,877 INFO L225 Difference]: With dead ends: 14868 [2019-12-27 01:08:58,877 INFO L226 Difference]: Without dead ends: 14868 [2019-12-27 01:08:58,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:08:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14868 states. [2019-12-27 01:08:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14868 to 14868. [2019-12-27 01:08:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14868 states. [2019-12-27 01:08:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14868 states to 14868 states and 45573 transitions. [2019-12-27 01:08:59,123 INFO L78 Accepts]: Start accepts. Automaton has 14868 states and 45573 transitions. Word has length 41 [2019-12-27 01:08:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:59,123 INFO L462 AbstractCegarLoop]: Abstraction has 14868 states and 45573 transitions. [2019-12-27 01:08:59,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:08:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 14868 states and 45573 transitions. [2019-12-27 01:08:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:08:59,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:59,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:59,146 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:59,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash -344664589, now seen corresponding path program 1 times [2019-12-27 01:08:59,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:59,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120211750] [2019-12-27 01:08:59,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:59,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120211750] [2019-12-27 01:08:59,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:59,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:08:59,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770230589] [2019-12-27 01:08:59,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:08:59,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:59,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:08:59,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:08:59,238 INFO L87 Difference]: Start difference. First operand 14868 states and 45573 transitions. Second operand 7 states. [2019-12-27 01:08:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:59,728 INFO L93 Difference]: Finished difference Result 43451 states and 132340 transitions. [2019-12-27 01:08:59,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:08:59,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 01:08:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:59,777 INFO L225 Difference]: With dead ends: 43451 [2019-12-27 01:08:59,778 INFO L226 Difference]: Without dead ends: 33731 [2019-12-27 01:08:59,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:08:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33731 states. [2019-12-27 01:09:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33731 to 18516. [2019-12-27 01:09:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18516 states. [2019-12-27 01:09:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18516 states to 18516 states and 56848 transitions. [2019-12-27 01:09:00,749 INFO L78 Accepts]: Start accepts. Automaton has 18516 states and 56848 transitions. Word has length 65 [2019-12-27 01:09:00,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:00,750 INFO L462 AbstractCegarLoop]: Abstraction has 18516 states and 56848 transitions. [2019-12-27 01:09:00,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:09:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 18516 states and 56848 transitions. [2019-12-27 01:09:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:09:00,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:00,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:00,776 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1662753005, now seen corresponding path program 2 times [2019-12-27 01:09:00,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:00,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008011280] [2019-12-27 01:09:00,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:00,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008011280] [2019-12-27 01:09:00,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:00,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:09:00,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158254523] [2019-12-27 01:09:00,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:09:00,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:00,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:09:00,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:09:00,878 INFO L87 Difference]: Start difference. First operand 18516 states and 56848 transitions. Second operand 7 states. [2019-12-27 01:09:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:01,386 INFO L93 Difference]: Finished difference Result 49218 states and 148223 transitions. [2019-12-27 01:09:01,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:09:01,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 01:09:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:01,436 INFO L225 Difference]: With dead ends: 49218 [2019-12-27 01:09:01,436 INFO L226 Difference]: Without dead ends: 35999 [2019-12-27 01:09:01,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:09:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35999 states. [2019-12-27 01:09:01,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35999 to 21947. [2019-12-27 01:09:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21947 states. [2019-12-27 01:09:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21947 states to 21947 states and 66970 transitions. [2019-12-27 01:09:01,884 INFO L78 Accepts]: Start accepts. Automaton has 21947 states and 66970 transitions. Word has length 65 [2019-12-27 01:09:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:01,884 INFO L462 AbstractCegarLoop]: Abstraction has 21947 states and 66970 transitions. [2019-12-27 01:09:01,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:09:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 21947 states and 66970 transitions. [2019-12-27 01:09:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:09:01,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:01,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:01,905 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:01,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:01,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1251052155, now seen corresponding path program 3 times [2019-12-27 01:09:01,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:01,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127905275] [2019-12-27 01:09:01,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:01,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127905275] [2019-12-27 01:09:01,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:01,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:09:01,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121300779] [2019-12-27 01:09:01,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:09:01,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:01,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:09:01,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:09:01,983 INFO L87 Difference]: Start difference. First operand 21947 states and 66970 transitions. Second operand 7 states. [2019-12-27 01:09:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:02,575 INFO L93 Difference]: Finished difference Result 42421 states and 127518 transitions. [2019-12-27 01:09:02,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 01:09:02,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 01:09:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:02,659 INFO L225 Difference]: With dead ends: 42421 [2019-12-27 01:09:02,659 INFO L226 Difference]: Without dead ends: 39710 [2019-12-27 01:09:02,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:09:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39710 states. [2019-12-27 01:09:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39710 to 22043. [2019-12-27 01:09:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22043 states. [2019-12-27 01:09:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22043 states to 22043 states and 67314 transitions. [2019-12-27 01:09:03,834 INFO L78 Accepts]: Start accepts. Automaton has 22043 states and 67314 transitions. Word has length 65 [2019-12-27 01:09:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:03,834 INFO L462 AbstractCegarLoop]: Abstraction has 22043 states and 67314 transitions. [2019-12-27 01:09:03,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:09:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 22043 states and 67314 transitions. [2019-12-27 01:09:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:09:03,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:03,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:03,859 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:03,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:03,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1414187811, now seen corresponding path program 4 times [2019-12-27 01:09:03,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:03,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045520733] [2019-12-27 01:09:03,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:03,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:03,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045520733] [2019-12-27 01:09:03,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:03,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:09:03,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726418356] [2019-12-27 01:09:03,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:09:03,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:03,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:09:03,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:03,917 INFO L87 Difference]: Start difference. First operand 22043 states and 67314 transitions. Second operand 3 states. [2019-12-27 01:09:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:04,069 INFO L93 Difference]: Finished difference Result 25110 states and 76797 transitions. [2019-12-27 01:09:04,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:09:04,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:09:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:04,118 INFO L225 Difference]: With dead ends: 25110 [2019-12-27 01:09:04,119 INFO L226 Difference]: Without dead ends: 25110 [2019-12-27 01:09:04,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25110 states. [2019-12-27 01:09:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25110 to 20735. [2019-12-27 01:09:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-27 01:09:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 64104 transitions. [2019-12-27 01:09:04,460 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 64104 transitions. Word has length 65 [2019-12-27 01:09:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:04,461 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 64104 transitions. [2019-12-27 01:09:04,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:09:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 64104 transitions. [2019-12-27 01:09:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:09:04,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:04,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:04,491 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1928104461, now seen corresponding path program 1 times [2019-12-27 01:09:04,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:04,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658021314] [2019-12-27 01:09:04,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:04,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658021314] [2019-12-27 01:09:04,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:04,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:09:04,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165791633] [2019-12-27 01:09:04,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:09:04,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:04,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:09:04,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:09:04,563 INFO L87 Difference]: Start difference. First operand 20735 states and 64104 transitions. Second operand 7 states. [2019-12-27 01:09:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:05,050 INFO L93 Difference]: Finished difference Result 43564 states and 133585 transitions. [2019-12-27 01:09:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 01:09:05,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 01:09:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:05,106 INFO L225 Difference]: With dead ends: 43564 [2019-12-27 01:09:05,106 INFO L226 Difference]: Without dead ends: 40319 [2019-12-27 01:09:05,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:09:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40319 states. [2019-12-27 01:09:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40319 to 20867. [2019-12-27 01:09:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20867 states. [2019-12-27 01:09:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20867 states to 20867 states and 64616 transitions. [2019-12-27 01:09:05,548 INFO L78 Accepts]: Start accepts. Automaton has 20867 states and 64616 transitions. Word has length 66 [2019-12-27 01:09:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:05,548 INFO L462 AbstractCegarLoop]: Abstraction has 20867 states and 64616 transitions. [2019-12-27 01:09:05,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:09:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 20867 states and 64616 transitions. [2019-12-27 01:09:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:09:05,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:05,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:05,569 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:05,569 INFO L82 PathProgramCache]: Analyzing trace with hash 104538735, now seen corresponding path program 2 times [2019-12-27 01:09:05,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:05,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386413709] [2019-12-27 01:09:05,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:05,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386413709] [2019-12-27 01:09:05,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:05,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:09:05,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128607893] [2019-12-27 01:09:05,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:09:05,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:05,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:09:05,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:09:05,639 INFO L87 Difference]: Start difference. First operand 20867 states and 64616 transitions. Second operand 4 states. [2019-12-27 01:09:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:05,779 INFO L93 Difference]: Finished difference Result 20682 states and 63880 transitions. [2019-12-27 01:09:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:09:05,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 01:09:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:05,813 INFO L225 Difference]: With dead ends: 20682 [2019-12-27 01:09:05,813 INFO L226 Difference]: Without dead ends: 20682 [2019-12-27 01:09:05,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:09:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20682 states. [2019-12-27 01:09:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20682 to 19455. [2019-12-27 01:09:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19455 states. [2019-12-27 01:09:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19455 states to 19455 states and 60082 transitions. [2019-12-27 01:09:06,650 INFO L78 Accepts]: Start accepts. Automaton has 19455 states and 60082 transitions. Word has length 66 [2019-12-27 01:09:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:06,650 INFO L462 AbstractCegarLoop]: Abstraction has 19455 states and 60082 transitions. [2019-12-27 01:09:06,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:09:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 19455 states and 60082 transitions. [2019-12-27 01:09:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:09:06,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:06,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:06,670 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:06,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:06,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1162997979, now seen corresponding path program 1 times [2019-12-27 01:09:06,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:06,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261333738] [2019-12-27 01:09:06,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:06,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261333738] [2019-12-27 01:09:06,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:06,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:09:06,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936546892] [2019-12-27 01:09:06,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:09:06,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:06,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:09:06,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:06,729 INFO L87 Difference]: Start difference. First operand 19455 states and 60082 transitions. Second operand 3 states. [2019-12-27 01:09:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:06,803 INFO L93 Difference]: Finished difference Result 16709 states and 50483 transitions. [2019-12-27 01:09:06,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:09:06,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:09:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:06,836 INFO L225 Difference]: With dead ends: 16709 [2019-12-27 01:09:06,836 INFO L226 Difference]: Without dead ends: 16709 [2019-12-27 01:09:06,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16709 states. [2019-12-27 01:09:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16709 to 15085. [2019-12-27 01:09:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15085 states. [2019-12-27 01:09:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15085 states to 15085 states and 45535 transitions. [2019-12-27 01:09:07,105 INFO L78 Accepts]: Start accepts. Automaton has 15085 states and 45535 transitions. Word has length 66 [2019-12-27 01:09:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:07,105 INFO L462 AbstractCegarLoop]: Abstraction has 15085 states and 45535 transitions. [2019-12-27 01:09:07,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:09:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 15085 states and 45535 transitions. [2019-12-27 01:09:07,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:07,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:07,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:07,121 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:07,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:07,122 INFO L82 PathProgramCache]: Analyzing trace with hash -543525966, now seen corresponding path program 1 times [2019-12-27 01:09:07,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:07,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099493405] [2019-12-27 01:09:07,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:07,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-27 01:09:07,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099493405] [2019-12-27 01:09:07,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:07,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:09:07,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988240854] [2019-12-27 01:09:07,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:09:07,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:07,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:09:07,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:09:07,293 INFO L87 Difference]: Start difference. First operand 15085 states and 45535 transitions. Second operand 10 states. [2019-12-27 01:09:08,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:08,612 INFO L93 Difference]: Finished difference Result 22528 states and 67687 transitions. [2019-12-27 01:09:08,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:09:08,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:09:08,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:08,641 INFO L225 Difference]: With dead ends: 22528 [2019-12-27 01:09:08,641 INFO L226 Difference]: Without dead ends: 18655 [2019-12-27 01:09:08,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:09:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18655 states. [2019-12-27 01:09:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18655 to 15486. [2019-12-27 01:09:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15486 states. [2019-12-27 01:09:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 46650 transitions. [2019-12-27 01:09:08,925 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 46650 transitions. Word has length 67 [2019-12-27 01:09:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:08,926 INFO L462 AbstractCegarLoop]: Abstraction has 15486 states and 46650 transitions. [2019-12-27 01:09:08,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:09:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 46650 transitions. [2019-12-27 01:09:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:08,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:08,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:08,942 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:08,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:08,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1737332378, now seen corresponding path program 2 times [2019-12-27 01:09:08,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:08,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901999642] [2019-12-27 01:09:08,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:09,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901999642] [2019-12-27 01:09:09,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:09,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:09:09,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567026907] [2019-12-27 01:09:09,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:09:09,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:09,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:09:09,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:09:09,166 INFO L87 Difference]: Start difference. First operand 15486 states and 46650 transitions. Second operand 11 states. [2019-12-27 01:09:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:10,968 INFO L93 Difference]: Finished difference Result 20850 states and 62350 transitions. [2019-12-27 01:09:10,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:09:10,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:09:10,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:10,993 INFO L225 Difference]: With dead ends: 20850 [2019-12-27 01:09:10,994 INFO L226 Difference]: Without dead ends: 18415 [2019-12-27 01:09:10,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:09:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18415 states. [2019-12-27 01:09:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18415 to 15406. [2019-12-27 01:09:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15406 states. [2019-12-27 01:09:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15406 states to 15406 states and 46410 transitions. [2019-12-27 01:09:11,233 INFO L78 Accepts]: Start accepts. Automaton has 15406 states and 46410 transitions. Word has length 67 [2019-12-27 01:09:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:11,233 INFO L462 AbstractCegarLoop]: Abstraction has 15406 states and 46410 transitions. [2019-12-27 01:09:11,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:09:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 15406 states and 46410 transitions. [2019-12-27 01:09:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:11,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:11,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:11,249 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:11,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:11,249 INFO L82 PathProgramCache]: Analyzing trace with hash 202288426, now seen corresponding path program 3 times [2019-12-27 01:09:11,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:11,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12845503] [2019-12-27 01:09:11,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:11,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12845503] [2019-12-27 01:09:11,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:11,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:09:11,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917316627] [2019-12-27 01:09:11,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:09:11,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:09:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:09:11,404 INFO L87 Difference]: Start difference. First operand 15406 states and 46410 transitions. Second operand 10 states. [2019-12-27 01:09:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:12,785 INFO L93 Difference]: Finished difference Result 23323 states and 69368 transitions. [2019-12-27 01:09:12,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:09:12,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:09:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:12,813 INFO L225 Difference]: With dead ends: 23323 [2019-12-27 01:09:12,813 INFO L226 Difference]: Without dead ends: 19998 [2019-12-27 01:09:12,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:09:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19998 states. [2019-12-27 01:09:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19998 to 15790. [2019-12-27 01:09:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15790 states. [2019-12-27 01:09:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15790 states to 15790 states and 47396 transitions. [2019-12-27 01:09:13,093 INFO L78 Accepts]: Start accepts. Automaton has 15790 states and 47396 transitions. Word has length 67 [2019-12-27 01:09:13,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:13,094 INFO L462 AbstractCegarLoop]: Abstraction has 15790 states and 47396 transitions. [2019-12-27 01:09:13,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:09:13,094 INFO L276 IsEmpty]: Start isEmpty. Operand 15790 states and 47396 transitions. [2019-12-27 01:09:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:13,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:13,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:13,110 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:13,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:13,110 INFO L82 PathProgramCache]: Analyzing trace with hash -917850962, now seen corresponding path program 4 times [2019-12-27 01:09:13,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:13,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814825776] [2019-12-27 01:09:13,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:13,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814825776] [2019-12-27 01:09:13,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:13,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:09:13,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25212283] [2019-12-27 01:09:13,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:09:13,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:13,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:09:13,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:09:13,263 INFO L87 Difference]: Start difference. First operand 15790 states and 47396 transitions. Second operand 11 states. [2019-12-27 01:09:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:14,651 INFO L93 Difference]: Finished difference Result 22253 states and 66116 transitions. [2019-12-27 01:09:14,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:09:14,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:09:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:14,680 INFO L225 Difference]: With dead ends: 22253 [2019-12-27 01:09:14,680 INFO L226 Difference]: Without dead ends: 19642 [2019-12-27 01:09:14,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:09:14,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19642 states. [2019-12-27 01:09:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19642 to 15486. [2019-12-27 01:09:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15486 states. [2019-12-27 01:09:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 46480 transitions. [2019-12-27 01:09:14,944 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 46480 transitions. Word has length 67 [2019-12-27 01:09:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:14,944 INFO L462 AbstractCegarLoop]: Abstraction has 15486 states and 46480 transitions. [2019-12-27 01:09:14,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:09:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 46480 transitions. [2019-12-27 01:09:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:14,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:14,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:14,960 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash 668274002, now seen corresponding path program 5 times [2019-12-27 01:09:14,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:14,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143504751] [2019-12-27 01:09:14,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:15,663 WARN L192 SmtUtils]: Spent 531.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 01:09:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:15,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143504751] [2019-12-27 01:09:15,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:15,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:09:15,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303205374] [2019-12-27 01:09:15,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:09:15,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:15,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:09:15,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:09:15,687 INFO L87 Difference]: Start difference. First operand 15486 states and 46480 transitions. Second operand 11 states. [2019-12-27 01:09:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:16,910 INFO L93 Difference]: Finished difference Result 32811 states and 97292 transitions. [2019-12-27 01:09:16,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 01:09:16,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:09:16,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:16,945 INFO L225 Difference]: With dead ends: 32811 [2019-12-27 01:09:16,946 INFO L226 Difference]: Without dead ends: 26102 [2019-12-27 01:09:16,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 01:09:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26102 states. [2019-12-27 01:09:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26102 to 14741. [2019-12-27 01:09:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14741 states. [2019-12-27 01:09:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14741 states to 14741 states and 44134 transitions. [2019-12-27 01:09:17,251 INFO L78 Accepts]: Start accepts. Automaton has 14741 states and 44134 transitions. Word has length 67 [2019-12-27 01:09:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:17,251 INFO L462 AbstractCegarLoop]: Abstraction has 14741 states and 44134 transitions. [2019-12-27 01:09:17,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:09:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 14741 states and 44134 transitions. [2019-12-27 01:09:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:17,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:17,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:17,267 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash -222673432, now seen corresponding path program 6 times [2019-12-27 01:09:17,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:17,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894867920] [2019-12-27 01:09:17,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:17,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894867920] [2019-12-27 01:09:17,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:17,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:09:17,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420987168] [2019-12-27 01:09:17,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:09:17,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:17,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:09:17,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:09:17,448 INFO L87 Difference]: Start difference. First operand 14741 states and 44134 transitions. Second operand 12 states. [2019-12-27 01:09:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:18,365 INFO L93 Difference]: Finished difference Result 26120 states and 77470 transitions. [2019-12-27 01:09:18,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:09:18,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 01:09:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:18,398 INFO L225 Difference]: With dead ends: 26120 [2019-12-27 01:09:18,399 INFO L226 Difference]: Without dead ends: 25905 [2019-12-27 01:09:18,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:09:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25905 states. [2019-12-27 01:09:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25905 to 14565. [2019-12-27 01:09:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14565 states. [2019-12-27 01:09:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14565 states to 14565 states and 43650 transitions. [2019-12-27 01:09:18,680 INFO L78 Accepts]: Start accepts. Automaton has 14565 states and 43650 transitions. Word has length 67 [2019-12-27 01:09:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:18,680 INFO L462 AbstractCegarLoop]: Abstraction has 14565 states and 43650 transitions. [2019-12-27 01:09:18,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:09:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 14565 states and 43650 transitions. [2019-12-27 01:09:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:18,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:18,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:18,695 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:18,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:18,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1210625396, now seen corresponding path program 7 times [2019-12-27 01:09:18,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:18,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825762224] [2019-12-27 01:09:18,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:09:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:09:18,819 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:09:18,820 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:09:18,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$r_buff0_thd2~0_185 0) (= 0 |v_ULTIMATE.start_main_~#t74~0.offset_23|) (= 0 v_~x~0_134) (= v_~z$w_buff0_used~0_784 0) (= v_~__unbuffered_p1_EBX~0_36 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1_used~0_442 0) (= |v_#NULL.offset_7| 0) (= v_~z~0_178 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t74~0.base_32|)) (= v_~z$r_buff1_thd0~0_195 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$read_delayed~0_6 0) (= v_~y~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t74~0.base_32| 1)) (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t74~0.base_32|) (= 0 v_~__unbuffered_cnt~0_87) (= v_~weak$$choice2~0_133 0) (= v_~z$r_buff0_thd1~0_306 0) (= 0 v_~z$flush_delayed~0_26) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff0_thd3~0_400) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t74~0.base_32| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t74~0.base_32|) |v_ULTIMATE.start_main_~#t74~0.offset_23| 0)) |v_#memory_int_21|) (= v_~z$w_buff1~0_222 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t74~0.base_32| 4)) (= 0 v_~__unbuffered_p0_EAX~0_142) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~z$r_buff1_thd3~0_306) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff1_thd1~0_175 0) (= v_~z$r_buff1_thd2~0_185 0) (= v_~z$w_buff0~0_312 0) (= v_~z$r_buff0_thd0~0_204 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t75~0.offset=|v_ULTIMATE.start_main_~#t75~0.offset_22|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_42|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_54|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_34|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t76~0.base=|v_ULTIMATE.start_main_~#t76~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_442, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ULTIMATE.start_main_~#t76~0.offset=|v_ULTIMATE.start_main_~#t76~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_400, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x~0=v_~x~0_134, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_62|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ULTIMATE.start_main_~#t75~0.base=|v_ULTIMATE.start_main_~#t75~0.base_29|, ULTIMATE.start_main_~#t74~0.offset=|v_ULTIMATE.start_main_~#t74~0.offset_23|, ~y~0=v_~y~0_24, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_36, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_312, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t74~0.base=|v_ULTIMATE.start_main_~#t74~0.base_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_133, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_306} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t75~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t76~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t76~0.offset, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t75~0.base, ULTIMATE.start_main_~#t74~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t74~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:09:18,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L750: Formula: (and (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1603892514)) (= ~x~0_In1603892514 ~__unbuffered_p0_EAX~0_Out1603892514) (= 1 ~z$r_buff0_thd1~0_Out1603892514) (= ~z$r_buff1_thd0~0_Out1603892514 ~z$r_buff0_thd0~0_In1603892514) (= ~z$r_buff0_thd1~0_In1603892514 ~z$r_buff1_thd1~0_Out1603892514) (= ~z$r_buff1_thd3~0_Out1603892514 ~z$r_buff0_thd3~0_In1603892514) (= ~z$r_buff0_thd2~0_In1603892514 ~z$r_buff1_thd2~0_Out1603892514)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603892514, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1603892514, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1603892514, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1603892514, ~x~0=~x~0_In1603892514, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1603892514} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1603892514, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603892514, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1603892514, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1603892514, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1603892514, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1603892514, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1603892514, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1603892514, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1603892514, ~x~0=~x~0_In1603892514, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1603892514} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:09:18,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t75~0.base_11| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t75~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t75~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t75~0.base_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t75~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t75~0.base_11|) |v_ULTIMATE.start_main_~#t75~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t75~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t75~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t75~0.offset=|v_ULTIMATE.start_main_~#t75~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t75~0.base=|v_ULTIMATE.start_main_~#t75~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t75~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t75~0.base, #length] because there is no mapped edge [2019-12-27 01:09:18,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1650766897 256))) (.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out1650766897| |P1Thread1of1ForFork2_#t~ite10_Out1650766897|)) (.cse1 (= (mod ~z$w_buff1_used~0_In1650766897 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1650766897| ~z~0_In1650766897) .cse0 (or .cse1 .cse2)) (and (not .cse2) .cse0 (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1650766897| ~z$w_buff1~0_In1650766897)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1650766897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1650766897, ~z$w_buff1~0=~z$w_buff1~0_In1650766897, ~z~0=~z~0_In1650766897} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1650766897|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1650766897, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1650766897|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1650766897, ~z$w_buff1~0=~z$w_buff1~0_In1650766897, ~z~0=~z~0_In1650766897} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:09:18,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1110969148 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1110969148 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1110969148| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1110969148| ~z$w_buff0_used~0_In-1110969148) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110969148, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1110969148} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110969148, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1110969148|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1110969148} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:09:18,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L834-1-->L836: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t76~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t76~0.base_11|) |v_ULTIMATE.start_main_~#t76~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t76~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t76~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t76~0.base_11|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t76~0.base_11| 4) |v_#length_15|) (= |v_ULTIMATE.start_main_~#t76~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t76~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t76~0.offset=|v_ULTIMATE.start_main_~#t76~0.offset_10|, ULTIMATE.start_main_~#t76~0.base=|v_ULTIMATE.start_main_~#t76~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t76~0.offset, ULTIMATE.start_main_~#t76~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 01:09:18,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1925624632 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1925624632 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1925624632 |P0Thread1of1ForFork1_#t~ite5_Out-1925624632|)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1925624632| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1925624632, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1925624632} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1925624632|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1925624632, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1925624632} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:09:18,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1784195273 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-1784195273 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In-1784195273 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1784195273 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1784195273| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite6_Out-1784195273| ~z$w_buff1_used~0_In-1784195273) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1784195273, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1784195273, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1784195273, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1784195273} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1784195273, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1784195273|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1784195273, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1784195273, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1784195273} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:09:18,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-567527046 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-567527046 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-567527046)) (and (= ~z$r_buff0_thd1~0_In-567527046 ~z$r_buff0_thd1~0_Out-567527046) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-567527046, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-567527046} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-567527046, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-567527046|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-567527046} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:09:18,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1696780390 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1696780390 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1696780390 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1696780390 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out1696780390| ~z$r_buff1_thd1~0_In1696780390)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out1696780390| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1696780390, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1696780390, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1696780390, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1696780390} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1696780390|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1696780390, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1696780390, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1696780390, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1696780390} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:09:18,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L754-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_78 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_78, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:09:18,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-605843768 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-605843768 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-605843768 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-605843768 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-605843768 |P1Thread1of1ForFork2_#t~ite12_Out-605843768|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-605843768|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-605843768, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-605843768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-605843768, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-605843768} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-605843768, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-605843768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-605843768, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-605843768|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-605843768} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:09:18,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-648597283 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-648597283 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-648597283| ~z$r_buff0_thd2~0_In-648597283) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-648597283| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-648597283, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-648597283} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-648597283, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-648597283|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-648597283} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:09:18,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1146500534 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1146500534 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1146500534 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1146500534 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1146500534| ~z$r_buff1_thd2~0_In1146500534)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out1146500534| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1146500534, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1146500534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1146500534, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1146500534} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1146500534, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1146500534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1146500534, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1146500534|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1146500534} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:09:18,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L777-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~z$r_buff1_thd2~0_132 |v_P1Thread1of1ForFork2_#t~ite14_36|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:09:18,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1262667192 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite30_Out-1262667192| |P2Thread1of1ForFork0_#t~ite29_Out-1262667192|) .cse0 (= ~z$w_buff1_used~0_In-1262667192 |P2Thread1of1ForFork0_#t~ite29_Out-1262667192|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1262667192 256)))) (or (= (mod ~z$w_buff0_used~0_In-1262667192 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In-1262667192 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-1262667192 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite30_Out-1262667192| ~z$w_buff1_used~0_In-1262667192) (= |P2Thread1of1ForFork0_#t~ite29_In-1262667192| |P2Thread1of1ForFork0_#t~ite29_Out-1262667192|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1262667192, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1262667192, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1262667192, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1262667192, ~weak$$choice2~0=~weak$$choice2~0_In-1262667192, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1262667192|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1262667192, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1262667192, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1262667192, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1262667192, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1262667192|, ~weak$$choice2~0=~weak$$choice2~0_In-1262667192, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1262667192|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:09:18,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:09:18,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_56 v_~z$mem_tmp~0_5) (= 0 v_~z$flush_delayed~0_11) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 01:09:18,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In255484829 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In255484829 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In255484829 |P2Thread1of1ForFork0_#t~ite38_Out255484829|) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In255484829 |P2Thread1of1ForFork0_#t~ite38_Out255484829|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In255484829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In255484829, ~z$w_buff1~0=~z$w_buff1~0_In255484829, ~z~0=~z~0_In255484829} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out255484829|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In255484829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In255484829, ~z$w_buff1~0=~z$w_buff1~0_In255484829, ~z~0=~z~0_In255484829} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:09:18,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_38 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 01:09:18,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1792697241 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1792697241 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1792697241| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1792697241| ~z$w_buff0_used~0_In1792697241)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1792697241, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1792697241} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1792697241, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1792697241|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1792697241} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:09:18,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-438449527 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-438449527 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-438449527 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-438449527 256)))) (or (and (= ~z$w_buff1_used~0_In-438449527 |P2Thread1of1ForFork0_#t~ite41_Out-438449527|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-438449527|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-438449527, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-438449527, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-438449527, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-438449527} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-438449527, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-438449527, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-438449527, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-438449527, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-438449527|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:09:18,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2052412291 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In2052412291 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out2052412291| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out2052412291| ~z$r_buff0_thd3~0_In2052412291) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2052412291, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2052412291} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2052412291, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2052412291, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out2052412291|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:09:18,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1986446317 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1986446317 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1986446317 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1986446317 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1986446317 |P2Thread1of1ForFork0_#t~ite43_Out1986446317|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1986446317|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1986446317, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1986446317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1986446317, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1986446317} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1986446317|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1986446317, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1986446317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1986446317, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1986446317} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:09:18,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~z$r_buff1_thd3~0_188 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:09:18,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 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_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:09:18,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-2057086536 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2057086536 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-2057086536| |ULTIMATE.start_main_#t~ite47_Out-2057086536|))) (or (and (= ~z$w_buff1~0_In-2057086536 |ULTIMATE.start_main_#t~ite47_Out-2057086536|) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~z~0_In-2057086536 |ULTIMATE.start_main_#t~ite47_Out-2057086536|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2057086536, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2057086536, ~z$w_buff1~0=~z$w_buff1~0_In-2057086536, ~z~0=~z~0_In-2057086536} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2057086536, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2057086536|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2057086536, ~z$w_buff1~0=~z$w_buff1~0_In-2057086536, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-2057086536|, ~z~0=~z~0_In-2057086536} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:09:18,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In286516566 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In286516566 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out286516566| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out286516566| ~z$w_buff0_used~0_In286516566) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In286516566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In286516566} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In286516566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In286516566, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out286516566|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:09:18,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1871633855 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1871633855 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1871633855 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1871633855 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1871633855 |ULTIMATE.start_main_#t~ite50_Out1871633855|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1871633855|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1871633855, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1871633855, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1871633855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1871633855} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1871633855|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1871633855, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1871633855, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1871633855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1871633855} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:09:18,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1098206869 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1098206869 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1098206869 |ULTIMATE.start_main_#t~ite51_Out-1098206869|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1098206869|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1098206869, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1098206869} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1098206869, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1098206869|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1098206869} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:09:18,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1979513413 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1979513413 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1979513413 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1979513413 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1979513413| ~z$r_buff1_thd0~0_In-1979513413) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1979513413| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1979513413, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1979513413, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1979513413, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1979513413} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1979513413|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1979513413, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1979513413, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1979513413, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1979513413} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:09:18,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~z$r_buff1_thd0~0_155 |v_ULTIMATE.start_main_#t~ite52_46|) (= 0 v_~__unbuffered_p0_EAX~0_114) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_46|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_45|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_155, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:09:19,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:09:19 BasicIcfg [2019-12-27 01:09:19,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:09:19,024 INFO L168 Benchmark]: Toolchain (without parser) took 105877.09 ms. Allocated memory was 145.2 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 100.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 01:09:19,025 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 01:09:19,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.13 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.9 MB in the beginning and 156.0 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:09:19,026 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.94 ms. Allocated memory is still 202.9 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:09:19,026 INFO L168 Benchmark]: Boogie Preprocessor took 49.41 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:09:19,032 INFO L168 Benchmark]: RCFGBuilder took 818.74 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 100.6 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:09:19,032 INFO L168 Benchmark]: TraceAbstraction took 104108.02 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 99.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 01:09:19,034 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.17 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 827.13 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.9 MB in the beginning and 156.0 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.94 ms. Allocated memory is still 202.9 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.41 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 818.74 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 100.6 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104108.02 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 99.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 29 ChoiceCompositions, 7593 VarBasedMoverChecksPositive, 373 VarBasedMoverChecksNegative, 200 SemBasedMoverChecksPositive, 268 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 132619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t74, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t75, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t76, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 103.6s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 26.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7089 SDtfs, 7096 SDslu, 23609 SDs, 0 SdLazy, 10661 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 34 SyntacticMatches, 17 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153153occurred 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: 47.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 211120 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1340 NumberOfCodeBlocks, 1340 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1243 ConstructedInterpolants, 0 QuantifiedInterpolants, 229487 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...