/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:46:45,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:46:45,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:46:45,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:46:45,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:46:45,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:46:45,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:46:45,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:46:45,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:46:45,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:46:45,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:46:45,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:46:45,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:46:45,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:46:45,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:46:45,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:46:45,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:46:45,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:46:45,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:46:45,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:46:45,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:46:45,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:46:45,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:46:45,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:46:45,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:46:45,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:46:45,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:46:45,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:46:45,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:46:45,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:46:45,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:46:45,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:46:45,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:46:45,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:46:45,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:46:45,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:46:45,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:46:45,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:46:45,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:46:45,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:46:45,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:46:45,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:46:45,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:46:45,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:46:45,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:46:45,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:46:45,875 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:46:45,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:46:45,875 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:46:45,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:46:45,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:46:45,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:46:45,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:46:45,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:46:45,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:46:45,877 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:46:45,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:46:45,877 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:46:45,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:46:45,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:46:45,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:46:45,878 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:46:45,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:46:45,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:46:45,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:46:45,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:46:45,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:46:45,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:46:45,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:46:45,880 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:46:45,880 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:46:45,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:46:45,880 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:46:45,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:46:46,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:46:46,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:46:46,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:46:46,193 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:46:46,194 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:46:46,195 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_rmo.oepc.i [2019-12-27 22:46:46,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0772034/3c2298783efb48c69bb2652a407aacea/FLAGa13abb494 [2019-12-27 22:46:46,824 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:46:46,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_rmo.oepc.i [2019-12-27 22:46:46,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0772034/3c2298783efb48c69bb2652a407aacea/FLAGa13abb494 [2019-12-27 22:46:47,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0772034/3c2298783efb48c69bb2652a407aacea [2019-12-27 22:46:47,132 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:46:47,134 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:46:47,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:46:47,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:46:47,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:46:47,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:46:47" (1/1) ... [2019-12-27 22:46:47,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9a289b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47, skipping insertion in model container [2019-12-27 22:46:47,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:46:47" (1/1) ... [2019-12-27 22:46:47,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:46:47,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:46:47,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:46:47,785 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:46:47,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:46:47,953 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:46:47,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47 WrapperNode [2019-12-27 22:46:47,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:46:47,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:46:47,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:46:47,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:46:47,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47" (1/1) ... [2019-12-27 22:46:47,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47" (1/1) ... [2019-12-27 22:46:48,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:46:48,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:46:48,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:46:48,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:46:48,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47" (1/1) ... [2019-12-27 22:46:48,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47" (1/1) ... [2019-12-27 22:46:48,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47" (1/1) ... [2019-12-27 22:46:48,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47" (1/1) ... [2019-12-27 22:46:48,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47" (1/1) ... [2019-12-27 22:46:48,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47" (1/1) ... [2019-12-27 22:46:48,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47" (1/1) ... [2019-12-27 22:46:48,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:46:48,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:46:48,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:46:48,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:46:48,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47" (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 22:46:48,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:46:48,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:46:48,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:46:48,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:46:48,133 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:46:48,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:46:48,134 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:46:48,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:46:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:46:48,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:46:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:46:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:46:48,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:46:48,138 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 22:46:48,822 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:46:48,823 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:46:48,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:46:48 BoogieIcfgContainer [2019-12-27 22:46:48,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:46:48,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:46:48,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:46:48,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:46:48,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:46:47" (1/3) ... [2019-12-27 22:46:48,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68544407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:46:48, skipping insertion in model container [2019-12-27 22:46:48,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:46:47" (2/3) ... [2019-12-27 22:46:48,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68544407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:46:48, skipping insertion in model container [2019-12-27 22:46:48,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:46:48" (3/3) ... [2019-12-27 22:46:48,837 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_rmo.oepc.i [2019-12-27 22:46:48,848 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:46:48,848 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:46:48,865 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:46:48,866 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:46:48,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,960 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,965 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,997 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,997 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:48,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,012 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,013 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,018 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:46:49,036 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:46:49,060 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:46:49,060 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:46:49,060 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:46:49,060 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:46:49,060 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:46:49,061 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:46:49,061 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:46:49,061 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:46:49,083 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 22:46:49,085 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 22:46:49,182 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 22:46:49,182 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:46:49,198 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:46:49,221 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 22:46:49,274 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 22:46:49,274 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:46:49,282 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:46:49,302 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:46:49,304 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:46:52,918 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 22:46:53,059 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 22:46:53,078 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75034 [2019-12-27 22:46:53,078 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 22:46:53,081 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 87 transitions [2019-12-27 22:47:04,500 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-27 22:47:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-27 22:47:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:47:04,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:04,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:47:04,513 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:04,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:04,518 INFO L82 PathProgramCache]: Analyzing trace with hash 797474655, now seen corresponding path program 1 times [2019-12-27 22:47:04,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:04,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664653805] [2019-12-27 22:47:04,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:04,796 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 22:47:04,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664653805] [2019-12-27 22:47:04,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:04,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:47:04,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [703211143] [2019-12-27 22:47:04,802 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:04,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:04,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:47:04,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:04,827 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:47:04,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:47:04,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:04,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:47:04,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:47:04,841 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-27 22:47:06,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:06,057 INFO L93 Difference]: Finished difference Result 84652 states and 359098 transitions. [2019-12-27 22:47:06,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:47:06,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:47:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:06,602 INFO L225 Difference]: With dead ends: 84652 [2019-12-27 22:47:06,603 INFO L226 Difference]: Without dead ends: 79738 [2019-12-27 22:47:06,604 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 22:47:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79738 states. [2019-12-27 22:47:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79738 to 79738. [2019-12-27 22:47:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79738 states. [2019-12-27 22:47:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79738 states to 79738 states and 337790 transitions. [2019-12-27 22:47:15,757 INFO L78 Accepts]: Start accepts. Automaton has 79738 states and 337790 transitions. Word has length 5 [2019-12-27 22:47:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:15,757 INFO L462 AbstractCegarLoop]: Abstraction has 79738 states and 337790 transitions. [2019-12-27 22:47:15,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:47:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 79738 states and 337790 transitions. [2019-12-27 22:47:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:47:15,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:15,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:47:15,768 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:15,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash 334215787, now seen corresponding path program 1 times [2019-12-27 22:47:15,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:15,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447987508] [2019-12-27 22:47:15,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:15,902 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 22:47:15,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447987508] [2019-12-27 22:47:15,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:15,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:47:15,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [466833972] [2019-12-27 22:47:15,903 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:15,905 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:15,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:47:15,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:15,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:47:15,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:47:15,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:15,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:47:15,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:47:15,912 INFO L87 Difference]: Start difference. First operand 79738 states and 337790 transitions. Second operand 4 states. [2019-12-27 22:47:20,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:20,330 INFO L93 Difference]: Finished difference Result 122590 states and 499694 transitions. [2019-12-27 22:47:20,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:47:20,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:47:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:20,962 INFO L225 Difference]: With dead ends: 122590 [2019-12-27 22:47:20,962 INFO L226 Difference]: Without dead ends: 122513 [2019-12-27 22:47:20,963 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 22:47:24,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122513 states. [2019-12-27 22:47:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122513 to 111273. [2019-12-27 22:47:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111273 states. [2019-12-27 22:47:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111273 states to 111273 states and 458752 transitions. [2019-12-27 22:47:27,913 INFO L78 Accepts]: Start accepts. Automaton has 111273 states and 458752 transitions. Word has length 13 [2019-12-27 22:47:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:27,914 INFO L462 AbstractCegarLoop]: Abstraction has 111273 states and 458752 transitions. [2019-12-27 22:47:27,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:47:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 111273 states and 458752 transitions. [2019-12-27 22:47:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:47:27,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:27,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:47:27,919 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:27,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:27,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985611, now seen corresponding path program 1 times [2019-12-27 22:47:27,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:27,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188861147] [2019-12-27 22:47:27,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:27,978 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 22:47:27,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188861147] [2019-12-27 22:47:27,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:27,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:47:27,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1077307010] [2019-12-27 22:47:27,979 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:27,982 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:27,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:47:27,986 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:27,986 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:47:27,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:47:27,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:27,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:47:27,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:47:27,987 INFO L87 Difference]: Start difference. First operand 111273 states and 458752 transitions. Second operand 3 states. [2019-12-27 22:47:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:28,107 INFO L93 Difference]: Finished difference Result 27590 states and 92015 transitions. [2019-12-27 22:47:28,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:47:28,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:47:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:28,159 INFO L225 Difference]: With dead ends: 27590 [2019-12-27 22:47:28,159 INFO L226 Difference]: Without dead ends: 27590 [2019-12-27 22:47:28,159 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 22:47:28,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27590 states. [2019-12-27 22:47:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27590 to 27590. [2019-12-27 22:47:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 22:47:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 92015 transitions. [2019-12-27 22:47:32,412 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 92015 transitions. Word has length 13 [2019-12-27 22:47:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:32,412 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 92015 transitions. [2019-12-27 22:47:32,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:47:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 92015 transitions. [2019-12-27 22:47:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:47:32,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:32,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:47:32,415 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:32,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:32,415 INFO L82 PathProgramCache]: Analyzing trace with hash -569288949, now seen corresponding path program 1 times [2019-12-27 22:47:32,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:32,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229691961] [2019-12-27 22:47:32,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:32,524 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 22:47:32,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229691961] [2019-12-27 22:47:32,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:32,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:47:32,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1208779937] [2019-12-27 22:47:32,525 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:32,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:32,531 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:47:32,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:32,533 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:47:32,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:47:32,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:32,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:47:32,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:47:32,534 INFO L87 Difference]: Start difference. First operand 27590 states and 92015 transitions. Second operand 5 states. [2019-12-27 22:47:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:33,015 INFO L93 Difference]: Finished difference Result 40899 states and 133989 transitions. [2019-12-27 22:47:33,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:47:33,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:47:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:33,088 INFO L225 Difference]: With dead ends: 40899 [2019-12-27 22:47:33,089 INFO L226 Difference]: Without dead ends: 40883 [2019-12-27 22:47:33,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:47:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40883 states. [2019-12-27 22:47:33,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40883 to 30763. [2019-12-27 22:47:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30763 states. [2019-12-27 22:47:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30763 states to 30763 states and 102099 transitions. [2019-12-27 22:47:33,685 INFO L78 Accepts]: Start accepts. Automaton has 30763 states and 102099 transitions. Word has length 14 [2019-12-27 22:47:33,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:33,685 INFO L462 AbstractCegarLoop]: Abstraction has 30763 states and 102099 transitions. [2019-12-27 22:47:33,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:47:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 30763 states and 102099 transitions. [2019-12-27 22:47:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:47:33,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:33,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] [2019-12-27 22:47:33,696 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:33,696 INFO L82 PathProgramCache]: Analyzing trace with hash -777509353, now seen corresponding path program 1 times [2019-12-27 22:47:33,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:33,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700099714] [2019-12-27 22:47:33,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:33,790 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 22:47:33,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700099714] [2019-12-27 22:47:33,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:33,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:47:33,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1542516236] [2019-12-27 22:47:33,791 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:33,795 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:33,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 22:47:33,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:33,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:47:33,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:47:33,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:33,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:47:33,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:47:33,811 INFO L87 Difference]: Start difference. First operand 30763 states and 102099 transitions. Second operand 6 states. [2019-12-27 22:47:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:34,952 INFO L93 Difference]: Finished difference Result 48043 states and 156144 transitions. [2019-12-27 22:47:34,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:47:34,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:47:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:35,043 INFO L225 Difference]: With dead ends: 48043 [2019-12-27 22:47:35,043 INFO L226 Difference]: Without dead ends: 48015 [2019-12-27 22:47:35,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:47:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48015 states. [2019-12-27 22:47:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48015 to 32442. [2019-12-27 22:47:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32442 states. [2019-12-27 22:47:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32442 states to 32442 states and 106747 transitions. [2019-12-27 22:47:35,721 INFO L78 Accepts]: Start accepts. Automaton has 32442 states and 106747 transitions. Word has length 22 [2019-12-27 22:47:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:35,722 INFO L462 AbstractCegarLoop]: Abstraction has 32442 states and 106747 transitions. [2019-12-27 22:47:35,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:47:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 32442 states and 106747 transitions. [2019-12-27 22:47:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:47:35,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:35,739 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 22:47:35,739 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:35,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:35,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050688, now seen corresponding path program 1 times [2019-12-27 22:47:35,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:35,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558610616] [2019-12-27 22:47:35,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:35,803 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 22:47:35,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558610616] [2019-12-27 22:47:35,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:35,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:47:35,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1371179257] [2019-12-27 22:47:35,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:35,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:35,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:47:35,813 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:35,813 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:47:35,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:47:35,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:35,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:47:35,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:47:35,814 INFO L87 Difference]: Start difference. First operand 32442 states and 106747 transitions. Second operand 4 states. [2019-12-27 22:47:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:35,885 INFO L93 Difference]: Finished difference Result 12531 states and 37988 transitions. [2019-12-27 22:47:35,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:47:35,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:47:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:35,912 INFO L225 Difference]: With dead ends: 12531 [2019-12-27 22:47:35,912 INFO L226 Difference]: Without dead ends: 12531 [2019-12-27 22:47:35,913 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 22:47:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12531 states. [2019-12-27 22:47:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12531 to 12391. [2019-12-27 22:47:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12391 states. [2019-12-27 22:47:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12391 states to 12391 states and 37578 transitions. [2019-12-27 22:47:36,312 INFO L78 Accepts]: Start accepts. Automaton has 12391 states and 37578 transitions. Word has length 25 [2019-12-27 22:47:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:36,313 INFO L462 AbstractCegarLoop]: Abstraction has 12391 states and 37578 transitions. [2019-12-27 22:47:36,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:47:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 12391 states and 37578 transitions. [2019-12-27 22:47:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:47:36,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:36,330 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 22:47:36,330 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:36,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:36,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1562204347, now seen corresponding path program 1 times [2019-12-27 22:47:36,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:36,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219953335] [2019-12-27 22:47:36,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:36,428 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 22:47:36,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219953335] [2019-12-27 22:47:36,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:36,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:47:36,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [581731538] [2019-12-27 22:47:36,429 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:36,437 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:36,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 143 transitions. [2019-12-27 22:47:36,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:36,517 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:47:36,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:47:36,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:36,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:47:36,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:47:36,518 INFO L87 Difference]: Start difference. First operand 12391 states and 37578 transitions. Second operand 6 states. [2019-12-27 22:47:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:36,584 INFO L93 Difference]: Finished difference Result 11113 states and 34299 transitions. [2019-12-27 22:47:36,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:47:36,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 22:47:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:36,607 INFO L225 Difference]: With dead ends: 11113 [2019-12-27 22:47:36,607 INFO L226 Difference]: Without dead ends: 11113 [2019-12-27 22:47:36,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:47:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11113 states. [2019-12-27 22:47:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11113 to 10665. [2019-12-27 22:47:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10665 states. [2019-12-27 22:47:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10665 states to 10665 states and 33035 transitions. [2019-12-27 22:47:36,849 INFO L78 Accepts]: Start accepts. Automaton has 10665 states and 33035 transitions. Word has length 39 [2019-12-27 22:47:36,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:36,849 INFO L462 AbstractCegarLoop]: Abstraction has 10665 states and 33035 transitions. [2019-12-27 22:47:36,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:47:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 10665 states and 33035 transitions. [2019-12-27 22:47:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:47:36,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:36,864 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] [2019-12-27 22:47:36,865 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:36,865 INFO L82 PathProgramCache]: Analyzing trace with hash 878583209, now seen corresponding path program 1 times [2019-12-27 22:47:36,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:36,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219156923] [2019-12-27 22:47:36,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:36,956 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 22:47:36,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219156923] [2019-12-27 22:47:36,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:36,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:47:36,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1918094358] [2019-12-27 22:47:36,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:36,974 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:37,129 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 467 transitions. [2019-12-27 22:47:37,129 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:37,216 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:47:37,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:47:37,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:37,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:47:37,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:47:37,218 INFO L87 Difference]: Start difference. First operand 10665 states and 33035 transitions. Second operand 7 states. [2019-12-27 22:47:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:37,731 INFO L93 Difference]: Finished difference Result 24444 states and 75151 transitions. [2019-12-27 22:47:37,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:47:37,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 22:47:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:37,753 INFO L225 Difference]: With dead ends: 24444 [2019-12-27 22:47:37,753 INFO L226 Difference]: Without dead ends: 13575 [2019-12-27 22:47:37,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:47:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13575 states. [2019-12-27 22:47:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13575 to 9092. [2019-12-27 22:47:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9092 states. [2019-12-27 22:47:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9092 states to 9092 states and 28032 transitions. [2019-12-27 22:47:37,916 INFO L78 Accepts]: Start accepts. Automaton has 9092 states and 28032 transitions. Word has length 54 [2019-12-27 22:47:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:37,916 INFO L462 AbstractCegarLoop]: Abstraction has 9092 states and 28032 transitions. [2019-12-27 22:47:37,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:47:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 9092 states and 28032 transitions. [2019-12-27 22:47:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:47:37,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:37,929 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] [2019-12-27 22:47:37,929 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:37,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:37,930 INFO L82 PathProgramCache]: Analyzing trace with hash 546394411, now seen corresponding path program 2 times [2019-12-27 22:47:37,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:37,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738794282] [2019-12-27 22:47:37,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:38,034 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 22:47:38,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738794282] [2019-12-27 22:47:38,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:38,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:47:38,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [33262409] [2019-12-27 22:47:38,035 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:38,052 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:38,343 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 361 transitions. [2019-12-27 22:47:38,343 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:38,469 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:47:38,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:47:38,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:38,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:47:38,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:47:38,470 INFO L87 Difference]: Start difference. First operand 9092 states and 28032 transitions. Second operand 8 states. [2019-12-27 22:47:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:38,877 INFO L93 Difference]: Finished difference Result 22341 states and 68728 transitions. [2019-12-27 22:47:38,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:47:38,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 22:47:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:38,903 INFO L225 Difference]: With dead ends: 22341 [2019-12-27 22:47:38,904 INFO L226 Difference]: Without dead ends: 17627 [2019-12-27 22:47:38,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:47:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17627 states. [2019-12-27 22:47:39,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17627 to 10818. [2019-12-27 22:47:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10818 states. [2019-12-27 22:47:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10818 states to 10818 states and 33605 transitions. [2019-12-27 22:47:39,122 INFO L78 Accepts]: Start accepts. Automaton has 10818 states and 33605 transitions. Word has length 54 [2019-12-27 22:47:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:39,122 INFO L462 AbstractCegarLoop]: Abstraction has 10818 states and 33605 transitions. [2019-12-27 22:47:39,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:47:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 10818 states and 33605 transitions. [2019-12-27 22:47:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:47:39,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:39,139 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] [2019-12-27 22:47:39,139 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2052295147, now seen corresponding path program 3 times [2019-12-27 22:47:39,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:39,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917779222] [2019-12-27 22:47:39,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:47:39,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917779222] [2019-12-27 22:47:39,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:39,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:47:39,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1049440900] [2019-12-27 22:47:39,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:39,285 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:39,455 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 421 transitions. [2019-12-27 22:47:39,455 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:39,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:47:39,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:47:39,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:39,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:47:39,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:47:39,637 INFO L87 Difference]: Start difference. First operand 10818 states and 33605 transitions. Second operand 11 states. [2019-12-27 22:47:41,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:41,820 INFO L93 Difference]: Finished difference Result 31380 states and 95814 transitions. [2019-12-27 22:47:41,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 22:47:41,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 22:47:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:41,854 INFO L225 Difference]: With dead ends: 31380 [2019-12-27 22:47:41,854 INFO L226 Difference]: Without dead ends: 23206 [2019-12-27 22:47:41,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-12-27 22:47:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23206 states. [2019-12-27 22:47:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23206 to 12570. [2019-12-27 22:47:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12570 states. [2019-12-27 22:47:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12570 states to 12570 states and 38891 transitions. [2019-12-27 22:47:42,105 INFO L78 Accepts]: Start accepts. Automaton has 12570 states and 38891 transitions. Word has length 54 [2019-12-27 22:47:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:42,105 INFO L462 AbstractCegarLoop]: Abstraction has 12570 states and 38891 transitions. [2019-12-27 22:47:42,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:47:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 12570 states and 38891 transitions. [2019-12-27 22:47:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:47:42,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:42,123 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] [2019-12-27 22:47:42,124 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash -243349385, now seen corresponding path program 4 times [2019-12-27 22:47:42,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:42,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122667118] [2019-12-27 22:47:42,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:42,215 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 22:47:42,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122667118] [2019-12-27 22:47:42,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:42,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:47:42,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1827521234] [2019-12-27 22:47:42,217 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:42,233 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:42,382 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 358 transitions. [2019-12-27 22:47:42,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:42,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 22:47:42,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:47:42,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:42,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:47:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:47:42,623 INFO L87 Difference]: Start difference. First operand 12570 states and 38891 transitions. Second operand 10 states. [2019-12-27 22:47:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:44,889 INFO L93 Difference]: Finished difference Result 50967 states and 157029 transitions. [2019-12-27 22:47:44,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 22:47:44,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:47:44,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:44,953 INFO L225 Difference]: With dead ends: 50967 [2019-12-27 22:47:44,953 INFO L226 Difference]: Without dead ends: 40513 [2019-12-27 22:47:44,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-12-27 22:47:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40513 states. [2019-12-27 22:47:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40513 to 14639. [2019-12-27 22:47:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14639 states. [2019-12-27 22:47:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14639 states to 14639 states and 45695 transitions. [2019-12-27 22:47:45,345 INFO L78 Accepts]: Start accepts. Automaton has 14639 states and 45695 transitions. Word has length 54 [2019-12-27 22:47:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:45,345 INFO L462 AbstractCegarLoop]: Abstraction has 14639 states and 45695 transitions. [2019-12-27 22:47:45,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:47:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 14639 states and 45695 transitions. [2019-12-27 22:47:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:47:45,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:45,362 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] [2019-12-27 22:47:45,362 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:45,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:45,363 INFO L82 PathProgramCache]: Analyzing trace with hash 647129887, now seen corresponding path program 1 times [2019-12-27 22:47:45,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:45,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819612364] [2019-12-27 22:47:45,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:45,425 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 22:47:45,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819612364] [2019-12-27 22:47:45,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:45,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:47:45,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2058993151] [2019-12-27 22:47:45,426 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:45,443 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:45,576 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 358 transitions. [2019-12-27 22:47:45,576 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:45,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:47:45,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:47:45,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:45,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:47:45,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:47:45,587 INFO L87 Difference]: Start difference. First operand 14639 states and 45695 transitions. Second operand 3 states. [2019-12-27 22:47:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:45,675 INFO L93 Difference]: Finished difference Result 20813 states and 64707 transitions. [2019-12-27 22:47:45,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:47:45,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 22:47:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:45,704 INFO L225 Difference]: With dead ends: 20813 [2019-12-27 22:47:45,705 INFO L226 Difference]: Without dead ends: 20813 [2019-12-27 22:47:45,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:47:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20813 states. [2019-12-27 22:47:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20813 to 18461. [2019-12-27 22:47:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18461 states. [2019-12-27 22:47:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18461 states to 18461 states and 57952 transitions. [2019-12-27 22:47:46,008 INFO L78 Accepts]: Start accepts. Automaton has 18461 states and 57952 transitions. Word has length 54 [2019-12-27 22:47:46,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:46,009 INFO L462 AbstractCegarLoop]: Abstraction has 18461 states and 57952 transitions. [2019-12-27 22:47:46,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:47:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 18461 states and 57952 transitions. [2019-12-27 22:47:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:47:46,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:46,030 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] [2019-12-27 22:47:46,030 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:46,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:46,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1558398603, now seen corresponding path program 5 times [2019-12-27 22:47:46,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:46,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173335710] [2019-12-27 22:47:46,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:46,130 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 22:47:46,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173335710] [2019-12-27 22:47:46,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:46,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:47:46,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1133875022] [2019-12-27 22:47:46,132 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:46,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:46,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 306 transitions. [2019-12-27 22:47:46,495 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:46,504 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:47:46,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:47:46,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:46,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:47:46,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:47:46,506 INFO L87 Difference]: Start difference. First operand 18461 states and 57952 transitions. Second operand 4 states. [2019-12-27 22:47:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:46,737 INFO L93 Difference]: Finished difference Result 21626 states and 65313 transitions. [2019-12-27 22:47:46,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:47:46,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:47:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:46,768 INFO L225 Difference]: With dead ends: 21626 [2019-12-27 22:47:46,768 INFO L226 Difference]: Without dead ends: 21626 [2019-12-27 22:47:46,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 22:47:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21626 states. [2019-12-27 22:47:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21626 to 15211. [2019-12-27 22:47:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15211 states. [2019-12-27 22:47:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15211 states to 15211 states and 46395 transitions. [2019-12-27 22:47:47,028 INFO L78 Accepts]: Start accepts. Automaton has 15211 states and 46395 transitions. Word has length 54 [2019-12-27 22:47:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:47,028 INFO L462 AbstractCegarLoop]: Abstraction has 15211 states and 46395 transitions. [2019-12-27 22:47:47,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:47:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 15211 states and 46395 transitions. [2019-12-27 22:47:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:47:47,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:47,049 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] [2019-12-27 22:47:47,049 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:47,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2068351876, now seen corresponding path program 1 times [2019-12-27 22:47:47,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:47,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735672081] [2019-12-27 22:47:47,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:47,161 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 22:47:47,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735672081] [2019-12-27 22:47:47,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:47,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:47:47,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [126899624] [2019-12-27 22:47:47,162 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:47,192 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:47,325 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 350 transitions. [2019-12-27 22:47:47,325 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:47,463 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:47:47,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:47:47,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:47,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:47:47,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:47:47,464 INFO L87 Difference]: Start difference. First operand 15211 states and 46395 transitions. Second operand 10 states. [2019-12-27 22:47:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:49,008 INFO L93 Difference]: Finished difference Result 24424 states and 72524 transitions. [2019-12-27 22:47:49,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:47:49,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 22:47:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:49,064 INFO L225 Difference]: With dead ends: 24424 [2019-12-27 22:47:49,064 INFO L226 Difference]: Without dead ends: 24276 [2019-12-27 22:47:49,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:47:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24276 states. [2019-12-27 22:47:49,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24276 to 19729. [2019-12-27 22:47:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19729 states. [2019-12-27 22:47:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19729 states to 19729 states and 59597 transitions. [2019-12-27 22:47:49,784 INFO L78 Accepts]: Start accepts. Automaton has 19729 states and 59597 transitions. Word has length 55 [2019-12-27 22:47:49,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:49,784 INFO L462 AbstractCegarLoop]: Abstraction has 19729 states and 59597 transitions. [2019-12-27 22:47:49,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:47:49,784 INFO L276 IsEmpty]: Start isEmpty. Operand 19729 states and 59597 transitions. [2019-12-27 22:47:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:47:49,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:49,811 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] [2019-12-27 22:47:49,811 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:49,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:49,811 INFO L82 PathProgramCache]: Analyzing trace with hash 41129598, now seen corresponding path program 2 times [2019-12-27 22:47:49,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:49,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011670391] [2019-12-27 22:47:49,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:49,919 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 22:47:49,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011670391] [2019-12-27 22:47:49,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:49,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:47:49,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [253732175] [2019-12-27 22:47:49,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:49,937 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:50,062 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 360 transitions. [2019-12-27 22:47:50,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:50,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 22:47:50,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:47:50,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:50,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:47:50,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:47:50,186 INFO L87 Difference]: Start difference. First operand 19729 states and 59597 transitions. Second operand 10 states. [2019-12-27 22:47:51,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:51,203 INFO L93 Difference]: Finished difference Result 28225 states and 83429 transitions. [2019-12-27 22:47:51,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:47:51,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 22:47:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:51,243 INFO L225 Difference]: With dead ends: 28225 [2019-12-27 22:47:51,243 INFO L226 Difference]: Without dead ends: 28225 [2019-12-27 22:47:51,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:47:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28225 states. [2019-12-27 22:47:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28225 to 20931. [2019-12-27 22:47:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20931 states. [2019-12-27 22:47:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20931 states to 20931 states and 63081 transitions. [2019-12-27 22:47:51,589 INFO L78 Accepts]: Start accepts. Automaton has 20931 states and 63081 transitions. Word has length 55 [2019-12-27 22:47:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:51,589 INFO L462 AbstractCegarLoop]: Abstraction has 20931 states and 63081 transitions. [2019-12-27 22:47:51,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:47:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 20931 states and 63081 transitions. [2019-12-27 22:47:51,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:47:51,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:51,609 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] [2019-12-27 22:47:51,609 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:51,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1084774030, now seen corresponding path program 3 times [2019-12-27 22:47:51,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:51,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228849881] [2019-12-27 22:47:51,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:51,848 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 22:47:51,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228849881] [2019-12-27 22:47:51,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:51,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:47:51,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1595256696] [2019-12-27 22:47:51,849 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:51,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:52,067 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 332 transitions. [2019-12-27 22:47:52,067 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:52,697 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:47:52,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:47:52,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:52,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:47:52,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:47:52,698 INFO L87 Difference]: Start difference. First operand 20931 states and 63081 transitions. Second operand 15 states. [2019-12-27 22:47:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:54,332 INFO L93 Difference]: Finished difference Result 48258 states and 144250 transitions. [2019-12-27 22:47:54,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 22:47:54,332 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 22:47:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:54,398 INFO L225 Difference]: With dead ends: 48258 [2019-12-27 22:47:54,398 INFO L226 Difference]: Without dead ends: 32910 [2019-12-27 22:47:54,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=282, Invalid=1278, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 22:47:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32910 states. [2019-12-27 22:47:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32910 to 20757. [2019-12-27 22:47:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20757 states. [2019-12-27 22:47:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20757 states to 20757 states and 62030 transitions. [2019-12-27 22:47:54,812 INFO L78 Accepts]: Start accepts. Automaton has 20757 states and 62030 transitions. Word has length 55 [2019-12-27 22:47:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:54,812 INFO L462 AbstractCegarLoop]: Abstraction has 20757 states and 62030 transitions. [2019-12-27 22:47:54,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:47:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 20757 states and 62030 transitions. [2019-12-27 22:47:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:47:54,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:54,835 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] [2019-12-27 22:47:54,835 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1458558076, now seen corresponding path program 4 times [2019-12-27 22:47:54,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:54,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126048280] [2019-12-27 22:47:54,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:47:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:47:54,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126048280] [2019-12-27 22:47:54,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:47:54,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:47:54,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [692090545] [2019-12-27 22:47:54,896 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:47:54,912 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:47:55,085 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 285 transitions. [2019-12-27 22:47:55,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:47:55,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:47:55,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:47:55,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:47:55,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:47:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:47:55,088 INFO L87 Difference]: Start difference. First operand 20757 states and 62030 transitions. Second operand 3 states. [2019-12-27 22:47:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:47:55,216 INFO L93 Difference]: Finished difference Result 20755 states and 62025 transitions. [2019-12-27 22:47:55,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:47:55,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:47:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:47:55,263 INFO L225 Difference]: With dead ends: 20755 [2019-12-27 22:47:55,263 INFO L226 Difference]: Without dead ends: 20755 [2019-12-27 22:47:55,264 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 22:47:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20755 states. [2019-12-27 22:47:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20755 to 18767. [2019-12-27 22:47:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18767 states. [2019-12-27 22:47:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18767 states to 18767 states and 56606 transitions. [2019-12-27 22:47:55,994 INFO L78 Accepts]: Start accepts. Automaton has 18767 states and 56606 transitions. Word has length 55 [2019-12-27 22:47:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:47:55,995 INFO L462 AbstractCegarLoop]: Abstraction has 18767 states and 56606 transitions. [2019-12-27 22:47:55,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:47:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 18767 states and 56606 transitions. [2019-12-27 22:47:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:47:56,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:47:56,027 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] [2019-12-27 22:47:56,027 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:47:56,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:47:56,027 INFO L82 PathProgramCache]: Analyzing trace with hash 379887659, now seen corresponding path program 1 times [2019-12-27 22:47:56,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:47:56,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582299999] [2019-12-27 22:47:56,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:47:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:47:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:47:56,219 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:47:56,219 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:47:56,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_53| 0 0))) (and (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2357~0.base_19| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2357~0.base_19|) |v_ULTIMATE.start_main_~#t2357~0.offset_15| 0)) |v_#memory_int_21|) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~x$r_buff0_thd0~0_20) (= v_~__unbuffered_p2_EBX~0_14 0) (= |v_ULTIMATE.start_main_~#t2357~0.offset_15| 0) (= 0 v_~weak$$choice0~0_5) (= v_~z~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_14) (= 0 v_~x$read_delayed_var~0.base_8) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2357~0.base_19| 4) |v_#length_21|) (= v_~x$w_buff1_used~0_67 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~x$flush_delayed~0_14 0) (= 0 v_~x$r_buff0_thd1~0_71) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2357~0.base_19|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_19| 1) |v_#valid_51|) (= v_~x$r_buff1_thd2~0_16 0) (= 0 v_~x$w_buff0_used~0_110) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_19|)) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$mem_tmp~0_11 0) (= v_~x~0_25 0) (= 0 v_~x$r_buff0_thd3~0_19) (= v_~y~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~x$r_buff1_thd0~0_19 0) (= 0 v_~x$w_buff0~0_29) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_~#t2357~0.base=|v_ULTIMATE.start_main_~#t2357~0.base_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_25, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_21|, ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_16|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_21|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~z~0=v_~z~0_10, ULTIMATE.start_main_~#t2357~0.offset=|v_ULTIMATE.start_main_~#t2357~0.offset_15|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2357~0.base, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2358~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2359~0.base, ULTIMATE.start_main_~#t2359~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t2357~0.offset, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:47:56,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2358~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t2358~0.offset_11| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2358~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13|) |v_ULTIMATE.start_main_~#t2358~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2358~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 22:47:56,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= |v_ULTIMATE.start_main_~#t2359~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t2359~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2359~0.base_13|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13|) |v_ULTIMATE.start_main_~#t2359~0.offset_11| 2))) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| 4)) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2359~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2359~0.base] because there is no mapped edge [2019-12-27 22:47:56,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] P1ENTRY-->L5-3: Formula: (and (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out2137188800 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out2137188800|) (= P1Thread1of1ForFork0_~arg.base_Out2137188800 |P1Thread1of1ForFork0_#in~arg.base_In2137188800|) (= ~x$w_buff0~0_Out2137188800 1) (= 1 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out2137188800|) (= P1Thread1of1ForFork0_~arg.offset_Out2137188800 |P1Thread1of1ForFork0_#in~arg.offset_In2137188800|) (= ~x$w_buff0_used~0_In2137188800 ~x$w_buff1_used~0_Out2137188800) (= 0 (mod ~x$w_buff1_used~0_Out2137188800 256)) (= ~x$w_buff0_used~0_Out2137188800 1) (= ~x$w_buff1~0_Out2137188800 ~x$w_buff0~0_In2137188800)) InVars {~x$w_buff0~0=~x$w_buff0~0_In2137188800, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In2137188800|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In2137188800|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2137188800} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out2137188800, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out2137188800, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out2137188800, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out2137188800, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out2137188800|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In2137188800|, ~x$w_buff1~0=~x$w_buff1~0_Out2137188800, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In2137188800|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out2137188800, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out2137188800} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 22:47:56,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1837583639 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1837583639 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1837583639| ~x~0_In-1837583639) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In-1837583639 |P2Thread1of1ForFork1_#t~ite32_Out-1837583639|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1837583639, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1837583639, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1837583639, ~x~0=~x~0_In-1837583639} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1837583639|, ~x$w_buff1~0=~x$w_buff1~0_In-1837583639, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1837583639, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1837583639, ~x~0=~x~0_In-1837583639} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:47:56,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 22:47:56,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1313370937 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1313370937 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out1313370937| 0)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1313370937 |P2Thread1of1ForFork1_#t~ite34_Out1313370937|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1313370937, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1313370937} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1313370937|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1313370937, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1313370937} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:47:56,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1648910167 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1648910167 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1648910167| ~x$w_buff0_used~0_In-1648910167) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1648910167|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1648910167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1648910167} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1648910167, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1648910167|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1648910167} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:47:56,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In791419923 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In791419923 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In791419923 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In791419923 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In791419923 |P1Thread1of1ForFork0_#t~ite29_Out791419923|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out791419923|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In791419923, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In791419923, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In791419923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In791419923} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In791419923, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In791419923, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In791419923, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out791419923|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In791419923} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:47:56,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1309908130 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1309908130 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1309908130) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1309908130 ~x$r_buff0_thd2~0_Out1309908130)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1309908130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1309908130} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1309908130|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1309908130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1309908130} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:47:56,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In983295797 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In983295797 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In983295797 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In983295797 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out983295797| 0)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out983295797| ~x$r_buff1_thd2~0_In983295797) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In983295797, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In983295797, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In983295797, ~x$w_buff0_used~0=~x$w_buff0_used~0_In983295797} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out983295797|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In983295797, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In983295797, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In983295797, ~x$w_buff0_used~0=~x$w_buff0_used~0_In983295797} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:47:56,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L781-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_11 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 22:47:56,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1650648577 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out1650648577| ~x$w_buff1~0_In1650648577) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In1650648577| |P0Thread1of1ForFork2_#t~ite11_Out1650648577|)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1650648577 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In1650648577 256) 0)) (and (= (mod ~x$r_buff1_thd1~0_In1650648577 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1650648577 256)))) (= |P0Thread1of1ForFork2_#t~ite11_Out1650648577| ~x$w_buff1~0_In1650648577) (= |P0Thread1of1ForFork2_#t~ite11_Out1650648577| |P0Thread1of1ForFork2_#t~ite12_Out1650648577|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1650648577, ~x$w_buff1~0=~x$w_buff1~0_In1650648577, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1650648577, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1650648577, ~weak$$choice2~0=~weak$$choice2~0_In1650648577, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In1650648577|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1650648577} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1650648577, ~x$w_buff1~0=~x$w_buff1~0_In1650648577, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1650648577, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1650648577, ~weak$$choice2~0=~weak$$choice2~0_In1650648577, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out1650648577|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out1650648577|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1650648577} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 22:47:56,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1703915626 256)))) (or (and (= ~x$w_buff0_used~0_In1703915626 |P0Thread1of1ForFork2_#t~ite14_Out1703915626|) (= |P0Thread1of1ForFork2_#t~ite14_Out1703915626| |P0Thread1of1ForFork2_#t~ite15_Out1703915626|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1703915626 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In1703915626 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1703915626 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In1703915626 256)) .cse1)))) (and (= |P0Thread1of1ForFork2_#t~ite14_In1703915626| |P0Thread1of1ForFork2_#t~ite14_Out1703915626|) (= ~x$w_buff0_used~0_In1703915626 |P0Thread1of1ForFork2_#t~ite15_Out1703915626|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1703915626, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1703915626, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1703915626, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1703915626|, ~weak$$choice2~0=~weak$$choice2~0_In1703915626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1703915626} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1703915626, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1703915626, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1703915626|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1703915626, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1703915626|, ~weak$$choice2~0=~weak$$choice2~0_In1703915626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1703915626} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 22:47:56,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L745-->L745-8: Formula: (let ((.cse4 (= (mod ~x$r_buff1_thd1~0_In2136849206 256) 0)) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In2136849206 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2136849206 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In2136849206 256) 0)) (.cse3 (= |P0Thread1of1ForFork2_#t~ite18_Out2136849206| |P0Thread1of1ForFork2_#t~ite17_Out2136849206|)) (.cse5 (= 0 (mod ~weak$$choice2~0_In2136849206 256)))) (or (let ((.cse0 (not .cse6))) (and (= |P0Thread1of1ForFork2_#t~ite16_Out2136849206| |P0Thread1of1ForFork2_#t~ite17_Out2136849206|) (or .cse0 (not .cse1)) (not .cse2) .cse3 (or .cse0 (not .cse4)) .cse5 (= |P0Thread1of1ForFork2_#t~ite16_Out2136849206| 0))) (and (or (and (or (and .cse6 .cse4) (and .cse6 .cse1) .cse2) .cse3 .cse5 (= ~x$w_buff1_used~0_In2136849206 |P0Thread1of1ForFork2_#t~ite17_Out2136849206|)) (and (= |P0Thread1of1ForFork2_#t~ite18_Out2136849206| ~x$w_buff1_used~0_In2136849206) (not .cse5) (= |P0Thread1of1ForFork2_#t~ite17_In2136849206| |P0Thread1of1ForFork2_#t~ite17_Out2136849206|))) (= |P0Thread1of1ForFork2_#t~ite16_In2136849206| |P0Thread1of1ForFork2_#t~ite16_Out2136849206|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2136849206, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In2136849206|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2136849206, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In2136849206|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2136849206, ~weak$$choice2~0=~weak$$choice2~0_In2136849206, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2136849206} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2136849206, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out2136849206|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out2136849206|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2136849206, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out2136849206|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2136849206, ~weak$$choice2~0=~weak$$choice2~0_In2136849206, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2136849206} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 22:47:56,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L746-->L747: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_44 v_~x$r_buff0_thd1~0_43)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 22:47:56,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L747-->L747-8: Formula: (let ((.cse4 (= (mod ~x$w_buff1_used~0_In1583566560 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1583566560 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In1583566560 256))) (.cse5 (= 0 (mod ~x$w_buff0_used~0_In1583566560 256))) (.cse2 (= (mod ~weak$$choice2~0_In1583566560 256) 0)) (.cse3 (= |P0Thread1of1ForFork2_#t~ite24_Out1583566560| |P0Thread1of1ForFork2_#t~ite23_Out1583566560|))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) .cse2 .cse3 (= |P0Thread1of1ForFork2_#t~ite22_Out1583566560| |P0Thread1of1ForFork2_#t~ite23_Out1583566560|) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out1583566560|) (or .cse1 (not .cse4)) (not .cse5))) (and (= |P0Thread1of1ForFork2_#t~ite22_In1583566560| |P0Thread1of1ForFork2_#t~ite22_Out1583566560|) (or (and (not .cse2) (= |P0Thread1of1ForFork2_#t~ite23_In1583566560| |P0Thread1of1ForFork2_#t~ite23_Out1583566560|) (= |P0Thread1of1ForFork2_#t~ite24_Out1583566560| ~x$r_buff1_thd1~0_In1583566560)) (and (or (and .cse6 .cse4) (and .cse0 .cse6) .cse5) .cse2 .cse3 (= ~x$r_buff1_thd1~0_In1583566560 |P0Thread1of1ForFork2_#t~ite23_Out1583566560|)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1583566560, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1583566560, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1583566560, ~weak$$choice2~0=~weak$$choice2~0_In1583566560, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1583566560|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In1583566560|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1583566560} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1583566560, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1583566560, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1583566560, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1583566560|, ~weak$$choice2~0=~weak$$choice2~0_In1583566560, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1583566560|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out1583566560|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1583566560} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 22:47:56,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_18) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:47:56,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In64951847 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In64951847 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In64951847 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In64951847 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out64951847| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In64951847 |P2Thread1of1ForFork1_#t~ite35_Out64951847|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In64951847, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In64951847, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In64951847, ~x$w_buff0_used~0=~x$w_buff0_used~0_In64951847} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out64951847|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In64951847, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In64951847, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In64951847, ~x$w_buff0_used~0=~x$w_buff0_used~0_In64951847} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:47:56,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-339487699 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-339487699 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-339487699| 0)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-339487699| ~x$r_buff0_thd3~0_In-339487699) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-339487699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-339487699} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-339487699|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-339487699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-339487699} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:47:56,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In351615949 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In351615949 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In351615949 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In351615949 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out351615949| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out351615949| ~x$r_buff1_thd3~0_In351615949) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In351615949, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In351615949, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In351615949, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351615949} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out351615949|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In351615949, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In351615949, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In351615949, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351615949} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:47:56,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 22:47:56,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:47:56,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-122273490 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-122273490 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-122273490 |ULTIMATE.start_main_#t~ite41_Out-122273490|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-122273490| ~x~0_In-122273490)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-122273490, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-122273490, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-122273490, ~x~0=~x~0_In-122273490} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-122273490|, ~x$w_buff1~0=~x$w_buff1~0_In-122273490, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-122273490, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-122273490, ~x~0=~x~0_In-122273490} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 22:47:56,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_8|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 22:47:56,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-85390028 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-85390028 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-85390028|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-85390028| ~x$w_buff0_used~0_In-85390028) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-85390028, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-85390028} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-85390028, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-85390028|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-85390028} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:47:56,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In479811476 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In479811476 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In479811476 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In479811476 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out479811476| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite44_Out479811476| ~x$w_buff1_used~0_In479811476)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In479811476, ~x$w_buff1_used~0=~x$w_buff1_used~0_In479811476, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In479811476, ~x$w_buff0_used~0=~x$w_buff0_used~0_In479811476} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In479811476, ~x$w_buff1_used~0=~x$w_buff1_used~0_In479811476, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In479811476, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out479811476|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In479811476} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:47:56,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In902318620 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In902318620 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In902318620 |ULTIMATE.start_main_#t~ite45_Out902318620|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out902318620|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In902318620, ~x$w_buff0_used~0=~x$w_buff0_used~0_In902318620} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In902318620, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out902318620|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In902318620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:47:56,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-283024426 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-283024426 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-283024426 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-283024426 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-283024426| 0)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-283024426 |ULTIMATE.start_main_#t~ite46_Out-283024426|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-283024426, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-283024426, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-283024426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-283024426} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-283024426, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-283024426|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-283024426, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-283024426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-283024426} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:47:56,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:47:56,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:47:56 BasicIcfg [2019-12-27 22:47:56,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:47:56,358 INFO L168 Benchmark]: Toolchain (without parser) took 69221.72 ms. Allocated memory was 137.9 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 101.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 986.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:47:56,359 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 22:47:56,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.12 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 100.9 MB in the beginning and 152.3 MB in the end (delta: -51.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:47:56,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.52 ms. Allocated memory is still 200.3 MB. Free memory was 152.3 MB in the beginning and 149.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:47:56,363 INFO L168 Benchmark]: Boogie Preprocessor took 40.62 ms. Allocated memory is still 200.3 MB. Free memory was 149.4 MB in the beginning and 147.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:47:56,364 INFO L168 Benchmark]: RCFGBuilder took 766.48 ms. Allocated memory is still 200.3 MB. Free memory was 147.4 MB in the beginning and 100.7 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:47:56,364 INFO L168 Benchmark]: TraceAbstraction took 67526.55 ms. Allocated memory was 200.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 100.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 922.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:47:56,374 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 819.12 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 100.9 MB in the beginning and 152.3 MB in the end (delta: -51.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.52 ms. Allocated memory is still 200.3 MB. Free memory was 152.3 MB in the beginning and 149.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.62 ms. Allocated memory is still 200.3 MB. Free memory was 149.4 MB in the beginning and 147.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 766.48 ms. Allocated memory is still 200.3 MB. Free memory was 147.4 MB in the beginning and 100.7 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67526.55 ms. Allocated memory was 200.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 100.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 922.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 87 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 30 ChoiceCompositions, 6629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75034 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 67.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3326 SDtfs, 4601 SDslu, 11229 SDs, 0 SdLazy, 6738 SolverSat, 184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 70 SyntacticMatches, 54 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111273occurred 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: 26.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 120072 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 731 NumberOfCodeBlocks, 731 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 101988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...