/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/mix015_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:07:51,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:07:51,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:07:51,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:07:51,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:07:51,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:07:51,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:07:51,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:07:51,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:07:51,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:07:51,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:07:51,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:07:51,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:07:51,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:07:51,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:07:51,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:07:51,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:07:51,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:07:51,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:07:51,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:07:51,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:07:51,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:07:51,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:07:51,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:07:51,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:07:51,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:07:51,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:07:51,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:07:51,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:07:51,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:07:51,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:07:51,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:07:51,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:07:51,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:07:51,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:07:51,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:07:51,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:07:51,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:07:51,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:07:51,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:07:51,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:07:51,958 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 20:07:51,977 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:07:51,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:07:51,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:07:51,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:07:51,979 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:07:51,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:07:51,980 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:07:51,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:07:51,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:07:51,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:07:51,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:07:51,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:07:51,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:07:51,981 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:07:51,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:07:51,981 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:07:51,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:07:51,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:07:51,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:07:51,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:07:51,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:07:51,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:07:51,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:07:51,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:07:51,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:07:51,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:07:51,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:07:51,984 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:07:51,984 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:07:51,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:07:51,985 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:07:51,985 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:07:52,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:07:52,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:07:52,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:07:52,293 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:07:52,293 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:07:52,294 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i [2019-12-27 20:07:52,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f895bd6/a2f0ee4057724f0e927a2445ec25884d/FLAG44e2c1252 [2019-12-27 20:07:52,984 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:07:52,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i [2019-12-27 20:07:52,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f895bd6/a2f0ee4057724f0e927a2445ec25884d/FLAG44e2c1252 [2019-12-27 20:07:53,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f895bd6/a2f0ee4057724f0e927a2445ec25884d [2019-12-27 20:07:53,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:07:53,319 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:07:53,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:07:53,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:07:53,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:07:53,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:07:53" (1/1) ... [2019-12-27 20:07:53,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b0b30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:53, skipping insertion in model container [2019-12-27 20:07:53,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:07:53" (1/1) ... [2019-12-27 20:07:53,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:07:53,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:07:53,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:07:53,966 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:07:54,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:07:54,107 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:07:54,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:54 WrapperNode [2019-12-27 20:07:54,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:07:54,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:07:54,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:07:54,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:07:54,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:54" (1/1) ... [2019-12-27 20:07:54,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:54" (1/1) ... [2019-12-27 20:07:54,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:07:54,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:07:54,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:07:54,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:07:54,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:54" (1/1) ... [2019-12-27 20:07:54,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:54" (1/1) ... [2019-12-27 20:07:54,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:54" (1/1) ... [2019-12-27 20:07:54,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:54" (1/1) ... [2019-12-27 20:07:54,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:54" (1/1) ... [2019-12-27 20:07:54,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:54" (1/1) ... [2019-12-27 20:07:54,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:54" (1/1) ... [2019-12-27 20:07:54,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:07:54,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:07:54,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:07:54,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:07:54,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:54" (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 20:07:54,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:07:54,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:07:54,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:07:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:07:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:07:54,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:07:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:07:54,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:07:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:07:54,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:07:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:07:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:07:54,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:07:54,332 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 20:07:55,223 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:07:55,223 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:07:55,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:07:55 BoogieIcfgContainer [2019-12-27 20:07:55,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:07:55,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:07:55,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:07:55,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:07:55,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:07:53" (1/3) ... [2019-12-27 20:07:55,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cdcbb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:07:55, skipping insertion in model container [2019-12-27 20:07:55,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:54" (2/3) ... [2019-12-27 20:07:55,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cdcbb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:07:55, skipping insertion in model container [2019-12-27 20:07:55,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:07:55" (3/3) ... [2019-12-27 20:07:55,234 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_power.oepc.i [2019-12-27 20:07:55,244 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:07:55,244 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:07:55,252 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:07:55,253 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:07:55,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,297 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,332 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,332 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,383 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,385 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,407 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,408 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:07:55,430 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:07:55,455 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:07:55,455 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:07:55,455 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:07:55,455 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:07:55,455 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:07:55,455 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:07:55,456 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:07:55,456 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:07:55,477 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 20:07:55,479 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 20:07:55,595 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 20:07:55,596 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:07:55,613 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:07:55,635 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 20:07:55,721 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 20:07:55,721 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:07:55,730 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:07:55,751 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 20:07:55,752 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:07:58,720 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-27 20:07:59,423 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 20:07:59,561 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 20:07:59,659 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83227 [2019-12-27 20:07:59,660 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 20:07:59,663 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-27 20:08:19,818 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120962 states. [2019-12-27 20:08:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand 120962 states. [2019-12-27 20:08:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:08:19,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:08:19,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:08:19,826 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:08:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:08:19,832 INFO L82 PathProgramCache]: Analyzing trace with hash 919898, now seen corresponding path program 1 times [2019-12-27 20:08:19,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:08:19,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096987839] [2019-12-27 20:08:19,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:08:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:08:20,060 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 20:08:20,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096987839] [2019-12-27 20:08:20,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:08:20,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:08:20,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094361309] [2019-12-27 20:08:20,063 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:08:20,068 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:08:20,081 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:08:20,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:08:20,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:08:20,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:08:20,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:08:20,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:08:20,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:08:20,104 INFO L87 Difference]: Start difference. First operand 120962 states. Second operand 3 states. [2019-12-27 20:08:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:08:24,117 INFO L93 Difference]: Finished difference Result 119798 states and 510282 transitions. [2019-12-27 20:08:24,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:08:24,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:08:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:08:24,858 INFO L225 Difference]: With dead ends: 119798 [2019-12-27 20:08:24,858 INFO L226 Difference]: Without dead ends: 112910 [2019-12-27 20:08:24,869 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 20:08:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112910 states. [2019-12-27 20:08:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112910 to 112910. [2019-12-27 20:08:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112910 states. [2019-12-27 20:08:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112910 states to 112910 states and 480308 transitions. [2019-12-27 20:08:34,595 INFO L78 Accepts]: Start accepts. Automaton has 112910 states and 480308 transitions. Word has length 3 [2019-12-27 20:08:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:08:34,595 INFO L462 AbstractCegarLoop]: Abstraction has 112910 states and 480308 transitions. [2019-12-27 20:08:34,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:08:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 112910 states and 480308 transitions. [2019-12-27 20:08:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:08:34,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:08:34,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:08:34,599 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:08:34,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:08:34,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1163520711, now seen corresponding path program 1 times [2019-12-27 20:08:34,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:08:34,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966461609] [2019-12-27 20:08:34,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:08:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:08:34,761 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 20:08:34,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966461609] [2019-12-27 20:08:34,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:08:34,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:08:34,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [496205731] [2019-12-27 20:08:34,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:08:34,766 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:08:34,771 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:08:34,771 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:08:34,772 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:08:34,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:08:34,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:08:34,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:08:34,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:08:34,774 INFO L87 Difference]: Start difference. First operand 112910 states and 480308 transitions. Second operand 4 states. [2019-12-27 20:08:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:08:40,238 INFO L93 Difference]: Finished difference Result 175260 states and 715456 transitions. [2019-12-27 20:08:40,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:08:40,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:08:40,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:08:41,164 INFO L225 Difference]: With dead ends: 175260 [2019-12-27 20:08:41,164 INFO L226 Difference]: Without dead ends: 175211 [2019-12-27 20:08:41,165 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 20:08:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175211 states. [2019-12-27 20:08:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175211 to 160651. [2019-12-27 20:08:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160651 states. [2019-12-27 20:08:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160651 states to 160651 states and 663882 transitions. [2019-12-27 20:08:52,169 INFO L78 Accepts]: Start accepts. Automaton has 160651 states and 663882 transitions. Word has length 11 [2019-12-27 20:08:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:08:52,169 INFO L462 AbstractCegarLoop]: Abstraction has 160651 states and 663882 transitions. [2019-12-27 20:08:52,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:08:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 160651 states and 663882 transitions. [2019-12-27 20:08:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:08:52,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:08:52,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:08:52,177 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:08:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:08:52,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1406257601, now seen corresponding path program 1 times [2019-12-27 20:08:52,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:08:52,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064452155] [2019-12-27 20:08:52,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:08:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:08:52,238 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 20:08:52,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064452155] [2019-12-27 20:08:52,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:08:52,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:08:52,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1611595495] [2019-12-27 20:08:52,239 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:08:52,240 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:08:52,242 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:08:52,243 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:08:52,243 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:08:52,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:08:52,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:08:52,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:08:52,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:08:52,244 INFO L87 Difference]: Start difference. First operand 160651 states and 663882 transitions. Second operand 3 states. [2019-12-27 20:08:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:08:52,431 INFO L93 Difference]: Finished difference Result 34503 states and 111808 transitions. [2019-12-27 20:08:52,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:08:52,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:08:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:08:52,491 INFO L225 Difference]: With dead ends: 34503 [2019-12-27 20:08:52,491 INFO L226 Difference]: Without dead ends: 34503 [2019-12-27 20:08:52,491 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 20:08:52,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34503 states. [2019-12-27 20:08:53,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34503 to 34503. [2019-12-27 20:08:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34503 states. [2019-12-27 20:08:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34503 states to 34503 states and 111808 transitions. [2019-12-27 20:08:58,574 INFO L78 Accepts]: Start accepts. Automaton has 34503 states and 111808 transitions. Word has length 13 [2019-12-27 20:08:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:08:58,575 INFO L462 AbstractCegarLoop]: Abstraction has 34503 states and 111808 transitions. [2019-12-27 20:08:58,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:08:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 34503 states and 111808 transitions. [2019-12-27 20:08:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:08:58,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:08:58,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:08:58,578 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:08:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:08:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1992610691, now seen corresponding path program 1 times [2019-12-27 20:08:58,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:08:58,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186731590] [2019-12-27 20:08:58,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:08:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:08:58,676 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 20:08:58,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186731590] [2019-12-27 20:08:58,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:08:58,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:08:58,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1165497718] [2019-12-27 20:08:58,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:08:58,680 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:08:58,682 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:08:58,683 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:08:58,683 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:08:58,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:08:58,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:08:58,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:08:58,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:08:58,684 INFO L87 Difference]: Start difference. First operand 34503 states and 111808 transitions. Second operand 4 states. [2019-12-27 20:08:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:08:59,086 INFO L93 Difference]: Finished difference Result 42846 states and 138316 transitions. [2019-12-27 20:08:59,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:08:59,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:08:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:08:59,158 INFO L225 Difference]: With dead ends: 42846 [2019-12-27 20:08:59,158 INFO L226 Difference]: Without dead ends: 42846 [2019-12-27 20:08:59,159 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 20:08:59,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42846 states. [2019-12-27 20:08:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42846 to 38560. [2019-12-27 20:08:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38560 states. [2019-12-27 20:08:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38560 states to 38560 states and 124897 transitions. [2019-12-27 20:08:59,858 INFO L78 Accepts]: Start accepts. Automaton has 38560 states and 124897 transitions. Word has length 16 [2019-12-27 20:08:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:08:59,859 INFO L462 AbstractCegarLoop]: Abstraction has 38560 states and 124897 transitions. [2019-12-27 20:08:59,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:08:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 38560 states and 124897 transitions. [2019-12-27 20:08:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:08:59,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:08:59,868 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 20:08:59,869 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:08:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:08:59,869 INFO L82 PathProgramCache]: Analyzing trace with hash 352437866, now seen corresponding path program 1 times [2019-12-27 20:08:59,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:08:59,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328593911] [2019-12-27 20:08:59,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:08:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:08:59,988 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 20:08:59,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328593911] [2019-12-27 20:08:59,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:08:59,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:08:59,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [628058368] [2019-12-27 20:08:59,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:08:59,993 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:00,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 64 transitions. [2019-12-27 20:09:00,003 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:00,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:00,032 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:09:00,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:09:00,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:09:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:09:00,033 INFO L87 Difference]: Start difference. First operand 38560 states and 124897 transitions. Second operand 7 states. [2019-12-27 20:09:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:01,786 INFO L93 Difference]: Finished difference Result 57113 states and 181206 transitions. [2019-12-27 20:09:01,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:09:01,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 20:09:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:01,886 INFO L225 Difference]: With dead ends: 57113 [2019-12-27 20:09:01,886 INFO L226 Difference]: Without dead ends: 57106 [2019-12-27 20:09:01,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:09:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57106 states. [2019-12-27 20:09:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57106 to 40050. [2019-12-27 20:09:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40050 states. [2019-12-27 20:09:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40050 states to 40050 states and 129823 transitions. [2019-12-27 20:09:02,696 INFO L78 Accepts]: Start accepts. Automaton has 40050 states and 129823 transitions. Word has length 22 [2019-12-27 20:09:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:02,696 INFO L462 AbstractCegarLoop]: Abstraction has 40050 states and 129823 transitions. [2019-12-27 20:09:02,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:09:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 40050 states and 129823 transitions. [2019-12-27 20:09:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:09:02,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:02,710 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 20:09:02,710 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:02,711 INFO L82 PathProgramCache]: Analyzing trace with hash -772014791, now seen corresponding path program 1 times [2019-12-27 20:09:02,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:02,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956155643] [2019-12-27 20:09:02,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:02,777 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 20:09:02,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956155643] [2019-12-27 20:09:02,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:02,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:09:02,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2048993836] [2019-12-27 20:09:02,779 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:02,782 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:02,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:09:02,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:02,846 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:09:02,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:09:02,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:02,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:09:02,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:09:02,847 INFO L87 Difference]: Start difference. First operand 40050 states and 129823 transitions. Second operand 5 states. [2019-12-27 20:09:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:02,930 INFO L93 Difference]: Finished difference Result 15790 states and 48319 transitions. [2019-12-27 20:09:02,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:09:02,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:09:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:02,955 INFO L225 Difference]: With dead ends: 15790 [2019-12-27 20:09:02,955 INFO L226 Difference]: Without dead ends: 15790 [2019-12-27 20:09:02,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:09:03,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15790 states. [2019-12-27 20:09:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15790 to 15498. [2019-12-27 20:09:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15498 states. [2019-12-27 20:09:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15498 states to 15498 states and 47487 transitions. [2019-12-27 20:09:03,193 INFO L78 Accepts]: Start accepts. Automaton has 15498 states and 47487 transitions. Word has length 25 [2019-12-27 20:09:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:03,193 INFO L462 AbstractCegarLoop]: Abstraction has 15498 states and 47487 transitions. [2019-12-27 20:09:03,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:09:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 15498 states and 47487 transitions. [2019-12-27 20:09:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:09:03,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:03,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:03,205 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:03,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:03,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1959375522, now seen corresponding path program 1 times [2019-12-27 20:09:03,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:03,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055003326] [2019-12-27 20:09:03,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:03,262 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 20:09:03,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055003326] [2019-12-27 20:09:03,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:03,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:09:03,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1022680378] [2019-12-27 20:09:03,264 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:03,268 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:03,275 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:09:03,275 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:03,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:09:03,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:09:03,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:03,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:09:03,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:09:03,276 INFO L87 Difference]: Start difference. First operand 15498 states and 47487 transitions. Second operand 3 states. [2019-12-27 20:09:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:03,513 INFO L93 Difference]: Finished difference Result 23991 states and 73072 transitions. [2019-12-27 20:09:03,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:09:03,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 20:09:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:03,547 INFO L225 Difference]: With dead ends: 23991 [2019-12-27 20:09:03,547 INFO L226 Difference]: Without dead ends: 23991 [2019-12-27 20:09:03,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:09:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23991 states. [2019-12-27 20:09:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23991 to 18266. [2019-12-27 20:09:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18266 states. [2019-12-27 20:09:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18266 states to 18266 states and 56498 transitions. [2019-12-27 20:09:03,858 INFO L78 Accepts]: Start accepts. Automaton has 18266 states and 56498 transitions. Word has length 27 [2019-12-27 20:09:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:03,859 INFO L462 AbstractCegarLoop]: Abstraction has 18266 states and 56498 transitions. [2019-12-27 20:09:03,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:09:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 18266 states and 56498 transitions. [2019-12-27 20:09:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:09:03,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:03,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:03,873 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1187835806, now seen corresponding path program 1 times [2019-12-27 20:09:03,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:03,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811325161] [2019-12-27 20:09:03,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:04,057 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 20:09:04,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811325161] [2019-12-27 20:09:04,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:04,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:09:04,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [656556787] [2019-12-27 20:09:04,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:04,065 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:04,072 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:09:04,072 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:04,072 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:09:04,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:09:04,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:04,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:09:04,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:09:04,074 INFO L87 Difference]: Start difference. First operand 18266 states and 56498 transitions. Second operand 7 states. [2019-12-27 20:09:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:05,212 INFO L93 Difference]: Finished difference Result 37482 states and 112830 transitions. [2019-12-27 20:09:05,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:09:05,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-27 20:09:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:05,291 INFO L225 Difference]: With dead ends: 37482 [2019-12-27 20:09:05,291 INFO L226 Difference]: Without dead ends: 37482 [2019-12-27 20:09:05,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:09:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37482 states. [2019-12-27 20:09:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37482 to 21515. [2019-12-27 20:09:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21515 states. [2019-12-27 20:09:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21515 states to 21515 states and 66173 transitions. [2019-12-27 20:09:05,741 INFO L78 Accepts]: Start accepts. Automaton has 21515 states and 66173 transitions. Word has length 27 [2019-12-27 20:09:05,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:05,742 INFO L462 AbstractCegarLoop]: Abstraction has 21515 states and 66173 transitions. [2019-12-27 20:09:05,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:09:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 21515 states and 66173 transitions. [2019-12-27 20:09:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:09:05,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:05,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:05,760 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:05,760 INFO L82 PathProgramCache]: Analyzing trace with hash 708131532, now seen corresponding path program 1 times [2019-12-27 20:09:05,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:05,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135950278] [2019-12-27 20:09:05,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:05,880 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 20:09:05,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135950278] [2019-12-27 20:09:05,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:05,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:09:05,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1696881245] [2019-12-27 20:09:05,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:05,886 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:05,893 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 20:09:05,894 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:05,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:09:05,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:09:05,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:05,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:09:05,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:09:05,895 INFO L87 Difference]: Start difference. First operand 21515 states and 66173 transitions. Second operand 6 states. [2019-12-27 20:09:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:07,066 INFO L93 Difference]: Finished difference Result 42383 states and 126645 transitions. [2019-12-27 20:09:07,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:09:07,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 20:09:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:07,142 INFO L225 Difference]: With dead ends: 42383 [2019-12-27 20:09:07,142 INFO L226 Difference]: Without dead ends: 42383 [2019-12-27 20:09:07,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:09:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42383 states. [2019-12-27 20:09:07,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42383 to 22256. [2019-12-27 20:09:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22256 states. [2019-12-27 20:09:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22256 states to 22256 states and 68897 transitions. [2019-12-27 20:09:07,662 INFO L78 Accepts]: Start accepts. Automaton has 22256 states and 68897 transitions. Word has length 28 [2019-12-27 20:09:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:07,663 INFO L462 AbstractCegarLoop]: Abstraction has 22256 states and 68897 transitions. [2019-12-27 20:09:07,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:09:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 22256 states and 68897 transitions. [2019-12-27 20:09:07,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:09:07,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:07,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:07,686 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:07,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:07,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2083615183, now seen corresponding path program 1 times [2019-12-27 20:09:07,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:07,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356636486] [2019-12-27 20:09:07,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:07,917 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 20:09:07,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356636486] [2019-12-27 20:09:07,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:07,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:09:07,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1809267789] [2019-12-27 20:09:07,919 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:07,925 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:07,947 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 76 transitions. [2019-12-27 20:09:07,947 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:07,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:08,070 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:09:08,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:09:08,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:08,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:09:08,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:09:08,071 INFO L87 Difference]: Start difference. First operand 22256 states and 68897 transitions. Second operand 10 states. [2019-12-27 20:09:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:11,672 INFO L93 Difference]: Finished difference Result 52289 states and 157201 transitions. [2019-12-27 20:09:11,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 20:09:11,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-12-27 20:09:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:11,754 INFO L225 Difference]: With dead ends: 52289 [2019-12-27 20:09:11,754 INFO L226 Difference]: Without dead ends: 52289 [2019-12-27 20:09:11,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-12-27 20:09:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52289 states. [2019-12-27 20:09:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52289 to 23331. [2019-12-27 20:09:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23331 states. [2019-12-27 20:09:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23331 states to 23331 states and 72287 transitions. [2019-12-27 20:09:12,503 INFO L78 Accepts]: Start accepts. Automaton has 23331 states and 72287 transitions. Word has length 33 [2019-12-27 20:09:12,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:12,504 INFO L462 AbstractCegarLoop]: Abstraction has 23331 states and 72287 transitions. [2019-12-27 20:09:12,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:09:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 23331 states and 72287 transitions. [2019-12-27 20:09:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:09:12,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:12,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:12,532 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:12,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:12,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2131169195, now seen corresponding path program 2 times [2019-12-27 20:09:12,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:12,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137128752] [2019-12-27 20:09:12,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:12,710 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 20:09:12,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137128752] [2019-12-27 20:09:12,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:12,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:09:12,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [123534200] [2019-12-27 20:09:12,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:12,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:12,742 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 70 transitions. [2019-12-27 20:09:12,742 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:12,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:12,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:09:12,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:09:12,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:12,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:09:12,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:09:12,770 INFO L87 Difference]: Start difference. First operand 23331 states and 72287 transitions. Second operand 9 states. [2019-12-27 20:09:15,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:15,727 INFO L93 Difference]: Finished difference Result 51118 states and 153825 transitions. [2019-12-27 20:09:15,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 20:09:15,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 20:09:15,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:15,807 INFO L225 Difference]: With dead ends: 51118 [2019-12-27 20:09:15,807 INFO L226 Difference]: Without dead ends: 51118 [2019-12-27 20:09:15,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2019-12-27 20:09:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51118 states. [2019-12-27 20:09:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51118 to 25182. [2019-12-27 20:09:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25182 states. [2019-12-27 20:09:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25182 states to 25182 states and 77941 transitions. [2019-12-27 20:09:16,620 INFO L78 Accepts]: Start accepts. Automaton has 25182 states and 77941 transitions. Word has length 33 [2019-12-27 20:09:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:16,621 INFO L462 AbstractCegarLoop]: Abstraction has 25182 states and 77941 transitions. [2019-12-27 20:09:16,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:09:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 25182 states and 77941 transitions. [2019-12-27 20:09:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:09:16,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:16,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:16,643 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:16,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash 572830043, now seen corresponding path program 3 times [2019-12-27 20:09:16,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:16,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710355208] [2019-12-27 20:09:16,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:16,922 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 20:09:16,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710355208] [2019-12-27 20:09:16,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:16,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:09:16,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [33338184] [2019-12-27 20:09:16,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:16,932 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:16,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 94 transitions. [2019-12-27 20:09:16,960 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:16,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:09:16,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:16,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:17,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:09:17,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:09:17,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:17,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:09:17,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:09:17,031 INFO L87 Difference]: Start difference. First operand 25182 states and 77941 transitions. Second operand 11 states. [2019-12-27 20:09:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:20,744 INFO L93 Difference]: Finished difference Result 65336 states and 195286 transitions. [2019-12-27 20:09:20,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 20:09:20,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-12-27 20:09:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:20,849 INFO L225 Difference]: With dead ends: 65336 [2019-12-27 20:09:20,849 INFO L226 Difference]: Without dead ends: 65336 [2019-12-27 20:09:20,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2019-12-27 20:09:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65336 states. [2019-12-27 20:09:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65336 to 25303. [2019-12-27 20:09:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25303 states. [2019-12-27 20:09:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25303 states to 25303 states and 78301 transitions. [2019-12-27 20:09:21,795 INFO L78 Accepts]: Start accepts. Automaton has 25303 states and 78301 transitions. Word has length 33 [2019-12-27 20:09:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:21,796 INFO L462 AbstractCegarLoop]: Abstraction has 25303 states and 78301 transitions. [2019-12-27 20:09:21,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:09:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 25303 states and 78301 transitions. [2019-12-27 20:09:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 20:09:21,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:21,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:21,821 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:21,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:21,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1529567545, now seen corresponding path program 1 times [2019-12-27 20:09:21,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:21,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598489406] [2019-12-27 20:09:21,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:21,996 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 20:09:21,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598489406] [2019-12-27 20:09:21,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:21,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:09:21,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [324799917] [2019-12-27 20:09:21,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:22,004 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:22,023 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 71 transitions. [2019-12-27 20:09:22,023 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:22,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:22,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:22,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:22,060 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:09:22,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:09:22,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:22,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:09:22,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:09:22,061 INFO L87 Difference]: Start difference. First operand 25303 states and 78301 transitions. Second operand 9 states. [2019-12-27 20:09:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:25,139 INFO L93 Difference]: Finished difference Result 51040 states and 152844 transitions. [2019-12-27 20:09:25,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 20:09:25,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 20:09:25,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:25,219 INFO L225 Difference]: With dead ends: 51040 [2019-12-27 20:09:25,219 INFO L226 Difference]: Without dead ends: 51040 [2019-12-27 20:09:25,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2019-12-27 20:09:25,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51040 states. [2019-12-27 20:09:25,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51040 to 22889. [2019-12-27 20:09:25,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22889 states. [2019-12-27 20:09:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22889 states to 22889 states and 71157 transitions. [2019-12-27 20:09:25,754 INFO L78 Accepts]: Start accepts. Automaton has 22889 states and 71157 transitions. Word has length 34 [2019-12-27 20:09:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:25,754 INFO L462 AbstractCegarLoop]: Abstraction has 22889 states and 71157 transitions. [2019-12-27 20:09:25,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:09:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 22889 states and 71157 transitions. [2019-12-27 20:09:25,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 20:09:25,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:25,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:25,781 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:25,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:25,781 INFO L82 PathProgramCache]: Analyzing trace with hash 276051641, now seen corresponding path program 2 times [2019-12-27 20:09:25,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:25,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898228435] [2019-12-27 20:09:25,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:25,962 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 20:09:25,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898228435] [2019-12-27 20:09:25,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:25,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:09:25,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099587556] [2019-12-27 20:09:25,963 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:25,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:25,996 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 98 transitions. [2019-12-27 20:09:25,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:25,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:09:25,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:26,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:26,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:26,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:26,042 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:09:26,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:09:26,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:26,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:09:26,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:09:26,043 INFO L87 Difference]: Start difference. First operand 22889 states and 71157 transitions. Second operand 10 states. [2019-12-27 20:09:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:29,683 INFO L93 Difference]: Finished difference Result 60261 states and 179603 transitions. [2019-12-27 20:09:29,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 20:09:29,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-27 20:09:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:29,776 INFO L225 Difference]: With dead ends: 60261 [2019-12-27 20:09:29,776 INFO L226 Difference]: Without dead ends: 60261 [2019-12-27 20:09:29,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 20:09:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60261 states. [2019-12-27 20:09:30,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60261 to 22303. [2019-12-27 20:09:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22303 states. [2019-12-27 20:09:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22303 states to 22303 states and 69292 transitions. [2019-12-27 20:09:30,367 INFO L78 Accepts]: Start accepts. Automaton has 22303 states and 69292 transitions. Word has length 34 [2019-12-27 20:09:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:30,367 INFO L462 AbstractCegarLoop]: Abstraction has 22303 states and 69292 transitions. [2019-12-27 20:09:30,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:09:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 22303 states and 69292 transitions. [2019-12-27 20:09:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:09:30,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:30,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:30,397 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:30,398 INFO L82 PathProgramCache]: Analyzing trace with hash -333124666, now seen corresponding path program 1 times [2019-12-27 20:09:30,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:30,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517058191] [2019-12-27 20:09:30,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:30,449 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 20:09:30,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517058191] [2019-12-27 20:09:30,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:30,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:09:30,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082827408] [2019-12-27 20:09:30,450 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:30,458 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:30,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 240 transitions. [2019-12-27 20:09:30,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:30,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:09:30,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:09:30,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:30,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:09:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:09:30,582 INFO L87 Difference]: Start difference. First operand 22303 states and 69292 transitions. Second operand 7 states. [2019-12-27 20:09:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:31,223 INFO L93 Difference]: Finished difference Result 43829 states and 136110 transitions. [2019-12-27 20:09:31,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:09:31,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 20:09:31,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:31,261 INFO L225 Difference]: With dead ends: 43829 [2019-12-27 20:09:31,261 INFO L226 Difference]: Without dead ends: 24805 [2019-12-27 20:09:31,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:09:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24805 states. [2019-12-27 20:09:31,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24805 to 21080. [2019-12-27 20:09:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21080 states. [2019-12-27 20:09:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21080 states to 21080 states and 63785 transitions. [2019-12-27 20:09:31,797 INFO L78 Accepts]: Start accepts. Automaton has 21080 states and 63785 transitions. Word has length 39 [2019-12-27 20:09:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:31,797 INFO L462 AbstractCegarLoop]: Abstraction has 21080 states and 63785 transitions. [2019-12-27 20:09:31,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:09:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 21080 states and 63785 transitions. [2019-12-27 20:09:31,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:09:31,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:31,816 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 20:09:31,817 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:31,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:31,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1572679302, now seen corresponding path program 2 times [2019-12-27 20:09:31,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:31,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105846531] [2019-12-27 20:09:31,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:31,861 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 20:09:31,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105846531] [2019-12-27 20:09:31,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:31,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:09:31,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [724731721] [2019-12-27 20:09:31,862 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:31,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:31,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 355 transitions. [2019-12-27 20:09:31,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:31,934 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:09:31,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:09:31,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:31,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:09:31,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:09:31,935 INFO L87 Difference]: Start difference. First operand 21080 states and 63785 transitions. Second operand 3 states. [2019-12-27 20:09:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:32,024 INFO L93 Difference]: Finished difference Result 21079 states and 63783 transitions. [2019-12-27 20:09:32,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:09:32,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:09:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:32,064 INFO L225 Difference]: With dead ends: 21079 [2019-12-27 20:09:32,065 INFO L226 Difference]: Without dead ends: 21079 [2019-12-27 20:09:32,065 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 20:09:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21079 states. [2019-12-27 20:09:32,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21079 to 21079. [2019-12-27 20:09:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21079 states. [2019-12-27 20:09:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21079 states to 21079 states and 63783 transitions. [2019-12-27 20:09:32,584 INFO L78 Accepts]: Start accepts. Automaton has 21079 states and 63783 transitions. Word has length 39 [2019-12-27 20:09:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:32,585 INFO L462 AbstractCegarLoop]: Abstraction has 21079 states and 63783 transitions. [2019-12-27 20:09:32,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:09:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 21079 states and 63783 transitions. [2019-12-27 20:09:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:09:32,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:32,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:32,616 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1861174117, now seen corresponding path program 1 times [2019-12-27 20:09:32,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:32,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445634556] [2019-12-27 20:09:32,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:32,699 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 20:09:32,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445634556] [2019-12-27 20:09:32,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:32,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:09:32,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599947783] [2019-12-27 20:09:32,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:32,709 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:32,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 122 transitions. [2019-12-27 20:09:32,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:32,759 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:09:32,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:09:32,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:32,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:09:32,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:09:32,760 INFO L87 Difference]: Start difference. First operand 21079 states and 63783 transitions. Second operand 5 states. [2019-12-27 20:09:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:33,170 INFO L93 Difference]: Finished difference Result 47960 states and 144142 transitions. [2019-12-27 20:09:33,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:09:33,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 20:09:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:33,218 INFO L225 Difference]: With dead ends: 47960 [2019-12-27 20:09:33,219 INFO L226 Difference]: Without dead ends: 29334 [2019-12-27 20:09:33,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:09:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29334 states. [2019-12-27 20:09:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29334 to 19184. [2019-12-27 20:09:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19184 states. [2019-12-27 20:09:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19184 states to 19184 states and 56207 transitions. [2019-12-27 20:09:33,560 INFO L78 Accepts]: Start accepts. Automaton has 19184 states and 56207 transitions. Word has length 40 [2019-12-27 20:09:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:33,560 INFO L462 AbstractCegarLoop]: Abstraction has 19184 states and 56207 transitions. [2019-12-27 20:09:33,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:09:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 19184 states and 56207 transitions. [2019-12-27 20:09:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:09:33,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:33,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:33,579 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:33,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:33,579 INFO L82 PathProgramCache]: Analyzing trace with hash 437381093, now seen corresponding path program 2 times [2019-12-27 20:09:33,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:33,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126479943] [2019-12-27 20:09:33,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:33,661 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 20:09:33,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126479943] [2019-12-27 20:09:33,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:33,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:09:33,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [429010387] [2019-12-27 20:09:33,662 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:33,674 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:33,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 20:09:33,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:33,778 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:09:33,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:09:33,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:33,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:09:33,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:09:33,781 INFO L87 Difference]: Start difference. First operand 19184 states and 56207 transitions. Second operand 3 states. [2019-12-27 20:09:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:33,905 INFO L93 Difference]: Finished difference Result 19092 states and 55919 transitions. [2019-12-27 20:09:33,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:09:33,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 20:09:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:33,951 INFO L225 Difference]: With dead ends: 19092 [2019-12-27 20:09:33,951 INFO L226 Difference]: Without dead ends: 19092 [2019-12-27 20:09:33,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:09:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19092 states. [2019-12-27 20:09:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19092 to 16669. [2019-12-27 20:09:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16669 states. [2019-12-27 20:09:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16669 states to 16669 states and 49584 transitions. [2019-12-27 20:09:34,546 INFO L78 Accepts]: Start accepts. Automaton has 16669 states and 49584 transitions. Word has length 40 [2019-12-27 20:09:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:34,547 INFO L462 AbstractCegarLoop]: Abstraction has 16669 states and 49584 transitions. [2019-12-27 20:09:34,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:09:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 16669 states and 49584 transitions. [2019-12-27 20:09:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:09:34,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:34,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:34,580 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:34,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1353733925, now seen corresponding path program 1 times [2019-12-27 20:09:34,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:34,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742253137] [2019-12-27 20:09:34,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:34,674 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 20:09:34,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742253137] [2019-12-27 20:09:34,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:34,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:09:34,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1545911754] [2019-12-27 20:09:34,675 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:34,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:34,808 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 426 transitions. [2019-12-27 20:09:34,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:34,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:09:34,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:09:34,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:34,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:09:34,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:09:34,873 INFO L87 Difference]: Start difference. First operand 16669 states and 49584 transitions. Second operand 7 states. [2019-12-27 20:09:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:35,011 INFO L93 Difference]: Finished difference Result 15425 states and 46807 transitions. [2019-12-27 20:09:35,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:09:35,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 20:09:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:35,044 INFO L225 Difference]: With dead ends: 15425 [2019-12-27 20:09:35,045 INFO L226 Difference]: Without dead ends: 12559 [2019-12-27 20:09:35,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:09:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12559 states. [2019-12-27 20:09:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12559 to 12559. [2019-12-27 20:09:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12559 states. [2019-12-27 20:09:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12559 states to 12559 states and 40010 transitions. [2019-12-27 20:09:35,457 INFO L78 Accepts]: Start accepts. Automaton has 12559 states and 40010 transitions. Word has length 41 [2019-12-27 20:09:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:35,457 INFO L462 AbstractCegarLoop]: Abstraction has 12559 states and 40010 transitions. [2019-12-27 20:09:35,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:09:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 12559 states and 40010 transitions. [2019-12-27 20:09:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:09:35,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:35,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:35,479 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:35,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1529197946, now seen corresponding path program 1 times [2019-12-27 20:09:35,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:35,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146706974] [2019-12-27 20:09:35,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:35,585 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 20:09:35,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146706974] [2019-12-27 20:09:35,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:35,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:09:35,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [446767222] [2019-12-27 20:09:35,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:35,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:35,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 425 transitions. [2019-12-27 20:09:35,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:36,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 20:09:36,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:09:36,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:36,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:09:36,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:09:36,036 INFO L87 Difference]: Start difference. First operand 12559 states and 40010 transitions. Second operand 13 states. [2019-12-27 20:09:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:37,717 INFO L93 Difference]: Finished difference Result 36322 states and 111841 transitions. [2019-12-27 20:09:37,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:09:37,718 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 20:09:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:37,760 INFO L225 Difference]: With dead ends: 36322 [2019-12-27 20:09:37,760 INFO L226 Difference]: Without dead ends: 26418 [2019-12-27 20:09:37,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:09:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26418 states. [2019-12-27 20:09:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26418 to 14379. [2019-12-27 20:09:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14379 states. [2019-12-27 20:09:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14379 states to 14379 states and 45437 transitions. [2019-12-27 20:09:38,238 INFO L78 Accepts]: Start accepts. Automaton has 14379 states and 45437 transitions. Word has length 65 [2019-12-27 20:09:38,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:38,238 INFO L462 AbstractCegarLoop]: Abstraction has 14379 states and 45437 transitions. [2019-12-27 20:09:38,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:09:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 14379 states and 45437 transitions. [2019-12-27 20:09:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:09:38,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:38,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:38,258 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1412718426, now seen corresponding path program 2 times [2019-12-27 20:09:38,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:38,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984192277] [2019-12-27 20:09:38,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:38,334 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 20:09:38,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984192277] [2019-12-27 20:09:38,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:38,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:09:38,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [745830112] [2019-12-27 20:09:38,335 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:38,356 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:38,551 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 262 states and 484 transitions. [2019-12-27 20:09:38,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:38,772 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 20:09:38,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:09:38,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:38,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:09:38,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:09:38,773 INFO L87 Difference]: Start difference. First operand 14379 states and 45437 transitions. Second operand 13 states. [2019-12-27 20:09:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:39,436 INFO L93 Difference]: Finished difference Result 27586 states and 85961 transitions. [2019-12-27 20:09:39,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:09:39,437 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 20:09:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:39,466 INFO L225 Difference]: With dead ends: 27586 [2019-12-27 20:09:39,466 INFO L226 Difference]: Without dead ends: 19769 [2019-12-27 20:09:39,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:09:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19769 states. [2019-12-27 20:09:39,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19769 to 16784. [2019-12-27 20:09:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16784 states. [2019-12-27 20:09:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16784 states to 16784 states and 52742 transitions. [2019-12-27 20:09:39,756 INFO L78 Accepts]: Start accepts. Automaton has 16784 states and 52742 transitions. Word has length 65 [2019-12-27 20:09:39,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:39,756 INFO L462 AbstractCegarLoop]: Abstraction has 16784 states and 52742 transitions. [2019-12-27 20:09:39,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:09:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 16784 states and 52742 transitions. [2019-12-27 20:09:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:09:39,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:39,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:39,774 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:39,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:39,774 INFO L82 PathProgramCache]: Analyzing trace with hash 33307276, now seen corresponding path program 3 times [2019-12-27 20:09:39,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:39,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196008943] [2019-12-27 20:09:39,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:39,904 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 20:09:39,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196008943] [2019-12-27 20:09:39,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:39,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:09:39,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1971731751] [2019-12-27 20:09:39,906 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:39,927 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:40,126 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 422 transitions. [2019-12-27 20:09:40,126 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:40,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 20:09:40,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:09:40,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:40,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:09:40,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:09:40,303 INFO L87 Difference]: Start difference. First operand 16784 states and 52742 transitions. Second operand 12 states. [2019-12-27 20:09:41,168 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-27 20:09:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:42,607 INFO L93 Difference]: Finished difference Result 60113 states and 182931 transitions. [2019-12-27 20:09:42,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 20:09:42,607 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 20:09:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:42,688 INFO L225 Difference]: With dead ends: 60113 [2019-12-27 20:09:42,689 INFO L226 Difference]: Without dead ends: 51772 [2019-12-27 20:09:42,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=454, Invalid=1526, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 20:09:42,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51772 states. [2019-12-27 20:09:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51772 to 16703. [2019-12-27 20:09:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16703 states. [2019-12-27 20:09:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16703 states to 16703 states and 52305 transitions. [2019-12-27 20:09:43,233 INFO L78 Accepts]: Start accepts. Automaton has 16703 states and 52305 transitions. Word has length 65 [2019-12-27 20:09:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:43,233 INFO L462 AbstractCegarLoop]: Abstraction has 16703 states and 52305 transitions. [2019-12-27 20:09:43,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:09:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 16703 states and 52305 transitions. [2019-12-27 20:09:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:09:43,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:43,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:43,252 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:43,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2002921922, now seen corresponding path program 4 times [2019-12-27 20:09:43,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:43,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563060898] [2019-12-27 20:09:43,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:43,312 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 20:09:43,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563060898] [2019-12-27 20:09:43,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:43,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:09:43,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2052956487] [2019-12-27 20:09:43,313 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:43,333 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:43,559 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 403 transitions. [2019-12-27 20:09:43,559 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:43,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:09:43,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:09:43,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:09:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:09:43,561 INFO L87 Difference]: Start difference. First operand 16703 states and 52305 transitions. Second operand 3 states. [2019-12-27 20:09:43,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:43,664 INFO L93 Difference]: Finished difference Result 19490 states and 60733 transitions. [2019-12-27 20:09:43,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:09:43,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:09:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:43,690 INFO L225 Difference]: With dead ends: 19490 [2019-12-27 20:09:43,691 INFO L226 Difference]: Without dead ends: 19490 [2019-12-27 20:09:43,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 20:09:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19490 states. [2019-12-27 20:09:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19490 to 16701. [2019-12-27 20:09:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16701 states. [2019-12-27 20:09:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16701 states to 16701 states and 52350 transitions. [2019-12-27 20:09:43,983 INFO L78 Accepts]: Start accepts. Automaton has 16701 states and 52350 transitions. Word has length 65 [2019-12-27 20:09:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:43,983 INFO L462 AbstractCegarLoop]: Abstraction has 16701 states and 52350 transitions. [2019-12-27 20:09:43,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:09:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 16701 states and 52350 transitions. [2019-12-27 20:09:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:09:44,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:44,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:44,001 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:44,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:44,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1068268020, now seen corresponding path program 1 times [2019-12-27 20:09:44,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:44,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174878408] [2019-12-27 20:09:44,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:44,045 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 20:09:44,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174878408] [2019-12-27 20:09:44,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:44,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:09:44,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [506773876] [2019-12-27 20:09:44,046 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:44,200 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:44,383 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 409 transitions. [2019-12-27 20:09:44,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:44,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:09:44,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:09:44,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:44,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:09:44,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:09:44,386 INFO L87 Difference]: Start difference. First operand 16701 states and 52350 transitions. Second operand 3 states. [2019-12-27 20:09:44,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:44,586 INFO L93 Difference]: Finished difference Result 24279 states and 75995 transitions. [2019-12-27 20:09:44,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:09:44,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:09:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:44,620 INFO L225 Difference]: With dead ends: 24279 [2019-12-27 20:09:44,620 INFO L226 Difference]: Without dead ends: 24279 [2019-12-27 20:09:44,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 20:09:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24279 states. [2019-12-27 20:09:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24279 to 17100. [2019-12-27 20:09:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17100 states. [2019-12-27 20:09:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17100 states to 17100 states and 53647 transitions. [2019-12-27 20:09:44,929 INFO L78 Accepts]: Start accepts. Automaton has 17100 states and 53647 transitions. Word has length 66 [2019-12-27 20:09:44,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:44,930 INFO L462 AbstractCegarLoop]: Abstraction has 17100 states and 53647 transitions. [2019-12-27 20:09:44,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:09:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 17100 states and 53647 transitions. [2019-12-27 20:09:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:09:44,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:44,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:44,947 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:44,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:44,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1537924046, now seen corresponding path program 2 times [2019-12-27 20:09:44,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:44,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238173182] [2019-12-27 20:09:44,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:45,085 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 20:09:45,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238173182] [2019-12-27 20:09:45,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:45,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:09:45,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1321506348] [2019-12-27 20:09:45,086 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:45,107 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:45,376 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 281 states and 562 transitions. [2019-12-27 20:09:45,377 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:45,801 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 20:09:45,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:09:45,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:45,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:09:45,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:09:45,802 INFO L87 Difference]: Start difference. First operand 17100 states and 53647 transitions. Second operand 14 states. [2019-12-27 20:09:51,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:51,275 INFO L93 Difference]: Finished difference Result 81967 states and 249692 transitions. [2019-12-27 20:09:51,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 20:09:51,275 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 20:09:51,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:51,365 INFO L225 Difference]: With dead ends: 81967 [2019-12-27 20:09:51,365 INFO L226 Difference]: Without dead ends: 58121 [2019-12-27 20:09:51,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 14 SyntacticMatches, 12 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1061, Invalid=3769, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 20:09:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58121 states. [2019-12-27 20:09:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58121 to 17577. [2019-12-27 20:09:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17577 states. [2019-12-27 20:09:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17577 states to 17577 states and 54758 transitions. [2019-12-27 20:09:51,951 INFO L78 Accepts]: Start accepts. Automaton has 17577 states and 54758 transitions. Word has length 66 [2019-12-27 20:09:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:51,951 INFO L462 AbstractCegarLoop]: Abstraction has 17577 states and 54758 transitions. [2019-12-27 20:09:51,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:09:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 17577 states and 54758 transitions. [2019-12-27 20:09:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:09:51,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:51,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:51,970 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:51,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:51,971 INFO L82 PathProgramCache]: Analyzing trace with hash 159393856, now seen corresponding path program 3 times [2019-12-27 20:09:51,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:51,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459557005] [2019-12-27 20:09:51,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:52,033 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 20:09:52,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459557005] [2019-12-27 20:09:52,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:52,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:09:52,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [133061550] [2019-12-27 20:09:52,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:52,055 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:52,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 285 states and 548 transitions. [2019-12-27 20:09:52,780 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:52,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:09:52,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:09:52,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:52,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:09:52,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:09:52,793 INFO L87 Difference]: Start difference. First operand 17577 states and 54758 transitions. Second operand 4 states. [2019-12-27 20:09:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:53,005 INFO L93 Difference]: Finished difference Result 17424 states and 54121 transitions. [2019-12-27 20:09:53,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:09:53,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 20:09:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:53,046 INFO L225 Difference]: With dead ends: 17424 [2019-12-27 20:09:53,046 INFO L226 Difference]: Without dead ends: 17424 [2019-12-27 20:09:53,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 5 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 20:09:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17424 states. [2019-12-27 20:09:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17424 to 15785. [2019-12-27 20:09:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15785 states. [2019-12-27 20:09:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15785 states to 15785 states and 49158 transitions. [2019-12-27 20:09:53,425 INFO L78 Accepts]: Start accepts. Automaton has 15785 states and 49158 transitions. Word has length 66 [2019-12-27 20:09:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:53,426 INFO L462 AbstractCegarLoop]: Abstraction has 15785 states and 49158 transitions. [2019-12-27 20:09:53,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:09:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 15785 states and 49158 transitions. [2019-12-27 20:09:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:09:53,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:53,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:53,443 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:53,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:53,444 INFO L82 PathProgramCache]: Analyzing trace with hash 673864792, now seen corresponding path program 1 times [2019-12-27 20:09:53,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:53,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950783549] [2019-12-27 20:09:53,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:53,507 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 20:09:53,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950783549] [2019-12-27 20:09:53,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:53,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:09:53,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1756941819] [2019-12-27 20:09:53,508 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:53,528 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:53,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 406 transitions. [2019-12-27 20:09:53,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:53,856 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:09:53,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:09:53,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:53,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:09:53,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:09:53,857 INFO L87 Difference]: Start difference. First operand 15785 states and 49158 transitions. Second operand 6 states. [2019-12-27 20:09:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:09:54,194 INFO L93 Difference]: Finished difference Result 15896 states and 49207 transitions. [2019-12-27 20:09:54,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:09:54,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 20:09:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:09:54,220 INFO L225 Difference]: With dead ends: 15896 [2019-12-27 20:09:54,220 INFO L226 Difference]: Without dead ends: 15896 [2019-12-27 20:09:54,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:09:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15896 states. [2019-12-27 20:09:54,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15896 to 10726. [2019-12-27 20:09:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10726 states. [2019-12-27 20:09:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10726 states to 10726 states and 33640 transitions. [2019-12-27 20:09:54,434 INFO L78 Accepts]: Start accepts. Automaton has 10726 states and 33640 transitions. Word has length 66 [2019-12-27 20:09:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:09:54,434 INFO L462 AbstractCegarLoop]: Abstraction has 10726 states and 33640 transitions. [2019-12-27 20:09:54,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:09:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 10726 states and 33640 transitions. [2019-12-27 20:09:54,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:09:54,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:09:54,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:09:54,446 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:09:54,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:09:54,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1633407744, now seen corresponding path program 1 times [2019-12-27 20:09:54,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:09:54,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478904773] [2019-12-27 20:09:54,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:09:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:09:54,624 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 20:09:54,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478904773] [2019-12-27 20:09:54,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:09:54,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:09:54,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1908155709] [2019-12-27 20:09:54,625 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:09:54,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:09:54,956 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 484 transitions. [2019-12-27 20:09:54,956 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:09:55,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:55,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:55,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:55,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:56,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:09:56,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:09:56,485 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-27 20:09:56,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 20:09:56,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 20:09:56,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:09:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 20:09:56,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:09:56,488 INFO L87 Difference]: Start difference. First operand 10726 states and 33640 transitions. Second operand 24 states. [2019-12-27 20:09:57,970 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 20:10:03,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:03,562 INFO L93 Difference]: Finished difference Result 27815 states and 85198 transitions. [2019-12-27 20:10:03,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 20:10:03,563 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-27 20:10:03,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:03,606 INFO L225 Difference]: With dead ends: 27815 [2019-12-27 20:10:03,606 INFO L226 Difference]: Without dead ends: 26796 [2019-12-27 20:10:03,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=662, Invalid=3498, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 20:10:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26796 states. [2019-12-27 20:10:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26796 to 14759. [2019-12-27 20:10:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14759 states. [2019-12-27 20:10:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14759 states to 14759 states and 46587 transitions. [2019-12-27 20:10:03,956 INFO L78 Accepts]: Start accepts. Automaton has 14759 states and 46587 transitions. Word has length 67 [2019-12-27 20:10:03,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:03,956 INFO L462 AbstractCegarLoop]: Abstraction has 14759 states and 46587 transitions. [2019-12-27 20:10:03,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 20:10:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 14759 states and 46587 transitions. [2019-12-27 20:10:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:10:03,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:03,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:03,973 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:10:03,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:03,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1333052502, now seen corresponding path program 2 times [2019-12-27 20:10:03,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:03,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922960866] [2019-12-27 20:10:03,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:04,126 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 20:10:04,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922960866] [2019-12-27 20:10:04,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:04,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:10:04,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [26707586] [2019-12-27 20:10:04,127 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:04,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:04,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 338 states and 697 transitions. [2019-12-27 20:10:04,620 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:05,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:05,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:05,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:05,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:05,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:10:05,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:05,874 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-27 20:10:05,875 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 20:10:05,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 20:10:05,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:05,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 20:10:05,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:10:05,875 INFO L87 Difference]: Start difference. First operand 14759 states and 46587 transitions. Second operand 25 states. [2019-12-27 20:10:08,443 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 20:10:10,530 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 20:10:11,837 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 20:10:14,239 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-27 20:10:15,214 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 20:10:17,415 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 20:10:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:19,382 INFO L93 Difference]: Finished difference Result 30949 states and 94129 transitions. [2019-12-27 20:10:19,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-12-27 20:10:19,383 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-12-27 20:10:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:19,422 INFO L225 Difference]: With dead ends: 30949 [2019-12-27 20:10:19,423 INFO L226 Difference]: Without dead ends: 25392 [2019-12-27 20:10:19,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 18 SyntacticMatches, 12 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2721 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1337, Invalid=7783, Unknown=0, NotChecked=0, Total=9120 [2019-12-27 20:10:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25392 states. [2019-12-27 20:10:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25392 to 11219. [2019-12-27 20:10:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11219 states. [2019-12-27 20:10:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11219 states to 11219 states and 34851 transitions. [2019-12-27 20:10:19,721 INFO L78 Accepts]: Start accepts. Automaton has 11219 states and 34851 transitions. Word has length 67 [2019-12-27 20:10:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:19,721 INFO L462 AbstractCegarLoop]: Abstraction has 11219 states and 34851 transitions. [2019-12-27 20:10:19,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 20:10:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 11219 states and 34851 transitions. [2019-12-27 20:10:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:10:19,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:19,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:19,734 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:10:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:19,734 INFO L82 PathProgramCache]: Analyzing trace with hash 755721406, now seen corresponding path program 3 times [2019-12-27 20:10:19,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:19,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005417944] [2019-12-27 20:10:19,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:19,921 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 20:10:19,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005417944] [2019-12-27 20:10:19,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:19,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:10:19,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [400351744] [2019-12-27 20:10:19,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:19,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:20,122 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 234 states and 449 transitions. [2019-12-27 20:10:20,123 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:20,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:20,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:20,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:20,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:20,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 20:10:20,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 20:10:20,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:20,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 20:10:20,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:10:20,753 INFO L87 Difference]: Start difference. First operand 11219 states and 34851 transitions. Second operand 19 states. [2019-12-27 20:10:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:22,059 INFO L93 Difference]: Finished difference Result 17768 states and 54733 transitions. [2019-12-27 20:10:22,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 20:10:22,060 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 20:10:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:22,084 INFO L225 Difference]: With dead ends: 17768 [2019-12-27 20:10:22,084 INFO L226 Difference]: Without dead ends: 16749 [2019-12-27 20:10:22,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 20:10:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16749 states. [2019-12-27 20:10:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16749 to 14761. [2019-12-27 20:10:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14761 states. [2019-12-27 20:10:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14761 states to 14761 states and 46081 transitions. [2019-12-27 20:10:22,329 INFO L78 Accepts]: Start accepts. Automaton has 14761 states and 46081 transitions. Word has length 67 [2019-12-27 20:10:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:22,329 INFO L462 AbstractCegarLoop]: Abstraction has 14761 states and 46081 transitions. [2019-12-27 20:10:22,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 20:10:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 14761 states and 46081 transitions. [2019-12-27 20:10:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:10:22,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:22,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:22,345 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:10:22,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:22,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2084228456, now seen corresponding path program 4 times [2019-12-27 20:10:22,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:22,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412195212] [2019-12-27 20:10:22,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:22,501 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 20:10:22,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412195212] [2019-12-27 20:10:22,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:22,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:10:22,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1981281131] [2019-12-27 20:10:22,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:22,596 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:22,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 320 states and 662 transitions. [2019-12-27 20:10:22,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:23,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:23,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:23,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:23,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:23,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 20:10:23,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 20:10:23,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:23,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 20:10:23,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:10:23,421 INFO L87 Difference]: Start difference. First operand 14761 states and 46081 transitions. Second operand 20 states. [2019-12-27 20:10:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:26,266 INFO L93 Difference]: Finished difference Result 20239 states and 61919 transitions. [2019-12-27 20:10:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 20:10:26,267 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 20:10:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:26,291 INFO L225 Difference]: With dead ends: 20239 [2019-12-27 20:10:26,292 INFO L226 Difference]: Without dead ends: 16248 [2019-12-27 20:10:26,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 13 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=341, Invalid=1551, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 20:10:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16248 states. [2019-12-27 20:10:26,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16248 to 11231. [2019-12-27 20:10:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11231 states. [2019-12-27 20:10:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11231 states to 11231 states and 34719 transitions. [2019-12-27 20:10:26,525 INFO L78 Accepts]: Start accepts. Automaton has 11231 states and 34719 transitions. Word has length 67 [2019-12-27 20:10:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:26,525 INFO L462 AbstractCegarLoop]: Abstraction has 11231 states and 34719 transitions. [2019-12-27 20:10:26,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 20:10:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 11231 states and 34719 transitions. [2019-12-27 20:10:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:10:26,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:26,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:26,539 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:10:26,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:26,539 INFO L82 PathProgramCache]: Analyzing trace with hash 797762192, now seen corresponding path program 5 times [2019-12-27 20:10:26,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:26,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121542660] [2019-12-27 20:10:26,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:26,710 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 20:10:26,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121542660] [2019-12-27 20:10:26,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:26,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:10:26,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28437646] [2019-12-27 20:10:26,711 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:26,726 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:26,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 478 transitions. [2019-12-27 20:10:26,904 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:27,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:27,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:27,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:27,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:10:27,827 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 39 times. [2019-12-27 20:10:27,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 20:10:27,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:27,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 20:10:27,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:10:27,828 INFO L87 Difference]: Start difference. First operand 11231 states and 34719 transitions. Second operand 21 states. [2019-12-27 20:10:29,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:29,098 INFO L93 Difference]: Finished difference Result 13819 states and 41642 transitions. [2019-12-27 20:10:29,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:10:29,099 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 20:10:29,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:29,119 INFO L225 Difference]: With dead ends: 13819 [2019-12-27 20:10:29,119 INFO L226 Difference]: Without dead ends: 13358 [2019-12-27 20:10:29,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 15 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 20:10:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13358 states. [2019-12-27 20:10:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13358 to 10911. [2019-12-27 20:10:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10911 states. [2019-12-27 20:10:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10911 states to 10911 states and 33799 transitions. [2019-12-27 20:10:29,318 INFO L78 Accepts]: Start accepts. Automaton has 10911 states and 33799 transitions. Word has length 67 [2019-12-27 20:10:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:10:29,318 INFO L462 AbstractCegarLoop]: Abstraction has 10911 states and 33799 transitions. [2019-12-27 20:10:29,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 20:10:29,319 INFO L276 IsEmpty]: Start isEmpty. Operand 10911 states and 33799 transitions. [2019-12-27 20:10:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:10:29,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:29,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:10:29,331 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:10:29,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:29,331 INFO L82 PathProgramCache]: Analyzing trace with hash 139331638, now seen corresponding path program 6 times [2019-12-27 20:10:29,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:29,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272409954] [2019-12-27 20:10:29,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:10:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:10:29,457 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:10:29,457 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:10:29,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~x~0_11 0) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t385~0.base_25|) (= 0 v_~a$w_buff1_used~0_71) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t385~0.base_25| 1)) (= 0 |v_ULTIMATE.start_main_~#t385~0.offset_20|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t385~0.base_25| 4)) (= 0 v_~a$w_buff1~0_21) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd3~0_77 0) (= 0 v_~weak$$choice2~0_34) (= 0 v_~a$w_buff0~0_23) (= v_~a$flush_delayed~0_13 0) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_13 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t385~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t385~0.base_25|) |v_ULTIMATE.start_main_~#t385~0.offset_20| 0)) |v_#memory_int_21|) (= v_~a$mem_tmp~0_10 0) (= 0 v_~a$r_buff1_thd1~0_21) (= v_~a$r_buff0_thd1~0_29 0) (= 0 v_~__unbuffered_p2_EAX~0_12) (= v_~a$r_buff0_thd2~0_21 0) (= 0 v_~a$r_buff1_thd0~0_22) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t385~0.base_25|)) (= 0 v_~a$r_buff1_thd2~0_17) (= 0 v_~z~0_8) (= v_~y~0_11 0) (= 0 v_~a$read_delayed~0_6) (= 0 v_~a$r_buff1_thd3~0_50) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= 0 v_~a$w_buff0_used~0_108) (= v_~a~0_27 0) (= v_~a$r_buff0_thd0~0_21 0) (= v_~__unbuffered_p0_EBX~0_15 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_19|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ULTIMATE.start_main_~#t386~0.base=|v_ULTIMATE.start_main_~#t386~0.base_25|, ULTIMATE.start_main_~#t387~0.offset=|v_ULTIMATE.start_main_~#t387~0.offset_15|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_50, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_108, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_29, ULTIMATE.start_main_~#t386~0.offset=|v_ULTIMATE.start_main_~#t386~0.offset_20|, ULTIMATE.start_main_~#t385~0.offset=|v_ULTIMATE.start_main_~#t385~0.offset_20|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t385~0.base=|v_ULTIMATE.start_main_~#t385~0.base_25|, ~a$w_buff0~0=v_~a$w_buff0~0_23, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_11, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~y~0=v_~y~0_11, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_21, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ULTIMATE.start_main_~#t387~0.base=|v_ULTIMATE.start_main_~#t387~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_8, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t386~0.base, ULTIMATE.start_main_~#t387~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t386~0.offset, ULTIMATE.start_main_~#t385~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t385~0.base, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ULTIMATE.start_main_~#t387~0.base, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 20:10:29,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t386~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t386~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t386~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t386~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t386~0.base_12|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t386~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t386~0.base_12|) |v_ULTIMATE.start_main_~#t386~0.offset_10| 1))) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t386~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t386~0.base=|v_ULTIMATE.start_main_~#t386~0.base_12|, ULTIMATE.start_main_~#t386~0.offset=|v_ULTIMATE.start_main_~#t386~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t386~0.base, ULTIMATE.start_main_~#t386~0.offset] because there is no mapped edge [2019-12-27 20:10:29,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L839-1-->L841: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t387~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t387~0.base_13| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t387~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t387~0.base_13| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t387~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t387~0.base_13|) |v_ULTIMATE.start_main_~#t387~0.offset_11| 2))) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t387~0.base_13| 1) |v_#valid_36|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t387~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t387~0.base=|v_ULTIMATE.start_main_~#t387~0.base_13|, ULTIMATE.start_main_~#t387~0.offset=|v_ULTIMATE.start_main_~#t387~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t387~0.base, ULTIMATE.start_main_~#t387~0.offset] because there is no mapped edge [2019-12-27 20:10:29,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L4-->L758: Formula: (and (= ~a$r_buff1_thd3~0_Out721491881 ~a$r_buff0_thd3~0_In721491881) (= 1 ~x~0_Out721491881) (= ~__unbuffered_p0_EAX~0_Out721491881 ~x~0_Out721491881) (= ~a$r_buff0_thd2~0_In721491881 ~a$r_buff1_thd2~0_Out721491881) (= ~y~0_In721491881 ~__unbuffered_p0_EBX~0_Out721491881) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In721491881 0)) (= ~a$r_buff0_thd1~0_Out721491881 1) (= ~a$r_buff1_thd1~0_Out721491881 ~a$r_buff0_thd1~0_In721491881) (= ~a$r_buff0_thd0~0_In721491881 ~a$r_buff1_thd0~0_Out721491881)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In721491881, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In721491881, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In721491881, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In721491881, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In721491881, ~y~0=~y~0_In721491881} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out721491881, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out721491881, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out721491881, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out721491881, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In721491881, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In721491881, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out721491881, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In721491881, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out721491881, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out721491881, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In721491881, ~y~0=~y~0_In721491881, ~x~0=~x~0_Out721491881} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 20:10:29,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In307505410 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In307505410 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out307505410| ~a$w_buff0_used~0_In307505410)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out307505410|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In307505410, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In307505410} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out307505410|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In307505410, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In307505410} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 20:10:29,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In921737526 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In921737526 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In921737526 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In921737526 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out921737526| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite6_Out921737526| ~a$w_buff1_used~0_In921737526)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In921737526, ~a$w_buff0_used~0=~a$w_buff0_used~0_In921737526, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In921737526, ~a$w_buff1_used~0=~a$w_buff1_used~0_In921737526} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out921737526|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In921737526, ~a$w_buff0_used~0=~a$w_buff0_used~0_In921737526, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In921737526, ~a$w_buff1_used~0=~a$w_buff1_used~0_In921737526} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 20:10:29,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-2138811024 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-2138811024 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-2138811024| ~a~0_In-2138811024) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-2138811024| ~a$w_buff1~0_In-2138811024) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-2138811024, ~a$w_buff1~0=~a$w_buff1~0_In-2138811024, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2138811024, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2138811024} OutVars{~a~0=~a~0_In-2138811024, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2138811024|, ~a$w_buff1~0=~a$w_buff1~0_In-2138811024, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2138811024, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2138811024} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 20:10:29,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= v_~a~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_18, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 20:10:29,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1087696673 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1087696673 256) 0))) (or (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-1087696673) (not .cse1)) (and (= ~a$r_buff0_thd1~0_In-1087696673 ~a$r_buff0_thd1~0_Out-1087696673) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1087696673, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1087696673} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1087696673|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1087696673, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1087696673} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:10:29,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In863139021 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In863139021 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In863139021 256))) (.cse2 (= (mod ~a$r_buff1_thd1~0_In863139021 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out863139021|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In863139021 |P0Thread1of1ForFork1_#t~ite8_Out863139021|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In863139021, ~a$w_buff0_used~0=~a$w_buff0_used~0_In863139021, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In863139021, ~a$w_buff1_used~0=~a$w_buff1_used~0_In863139021} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out863139021|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In863139021, ~a$w_buff0_used~0=~a$w_buff0_used~0_In863139021, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In863139021, ~a$w_buff1_used~0=~a$w_buff1_used~0_In863139021} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 20:10:29,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:10:29,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In2036629523 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In2036629523 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out2036629523| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out2036629523| ~a$w_buff0_used~0_In2036629523)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2036629523, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2036629523} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2036629523, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2036629523, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out2036629523|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:10:29,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1252277906 256)))) (or (and (= ~a$w_buff0~0_In1252277906 |P2Thread1of1ForFork0_#t~ite20_Out1252277906|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1252277906 256)))) (or (= (mod ~a$w_buff0_used~0_In1252277906 256) 0) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1252277906 256) 0)) (and .cse1 (= (mod ~a$w_buff1_used~0_In1252277906 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite21_Out1252277906| |P2Thread1of1ForFork0_#t~ite20_Out1252277906|)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out1252277906| ~a$w_buff0~0_In1252277906) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In1252277906| |P2Thread1of1ForFork0_#t~ite20_Out1252277906|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1252277906, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1252277906, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1252277906, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1252277906, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1252277906, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1252277906|, ~weak$$choice2~0=~weak$$choice2~0_In1252277906} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1252277906|, ~a$w_buff0~0=~a$w_buff0~0_In1252277906, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1252277906, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1252277906, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1252277906, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1252277906|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1252277906, ~weak$$choice2~0=~weak$$choice2~0_In1252277906} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 20:10:29,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1804511569 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In1804511569| |P2Thread1of1ForFork0_#t~ite23_Out1804511569|) (not .cse0) (= ~a$w_buff1~0_In1804511569 |P2Thread1of1ForFork0_#t~ite24_Out1804511569|)) (and (= ~a$w_buff1~0_In1804511569 |P2Thread1of1ForFork0_#t~ite23_Out1804511569|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1804511569 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In1804511569 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In1804511569 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In1804511569 256)) .cse1))) .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out1804511569| |P2Thread1of1ForFork0_#t~ite23_Out1804511569|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1804511569, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1804511569|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1804511569, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1804511569, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1804511569, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1804511569, ~weak$$choice2~0=~weak$$choice2~0_In1804511569} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1804511569, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1804511569|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1804511569|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1804511569, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1804511569, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1804511569, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1804511569, ~weak$$choice2~0=~weak$$choice2~0_In1804511569} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 20:10:29,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L805-->L805-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1215803284 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In1215803284| |P2Thread1of1ForFork0_#t~ite26_Out1215803284|) (= |P2Thread1of1ForFork0_#t~ite27_Out1215803284| ~a$w_buff0_used~0_In1215803284)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1215803284 256) 0))) (or (= (mod ~a$w_buff0_used~0_In1215803284 256) 0) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1215803284 256))) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1215803284 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite27_Out1215803284| |P2Thread1of1ForFork0_#t~ite26_Out1215803284|) .cse0 (= ~a$w_buff0_used~0_In1215803284 |P2Thread1of1ForFork0_#t~ite26_Out1215803284|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1215803284|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1215803284, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1215803284, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1215803284, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1215803284, ~weak$$choice2~0=~weak$$choice2~0_In1215803284} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1215803284|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1215803284|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1215803284, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1215803284, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1215803284, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1215803284, ~weak$$choice2~0=~weak$$choice2~0_In1215803284} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 20:10:29,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_49 v_~a$r_buff0_thd3~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:10:29,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_16 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_16, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 20:10:29,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In353954064 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In353954064 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out353954064| ~a$w_buff1~0_In353954064)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out353954064| ~a~0_In353954064)))) InVars {~a~0=~a~0_In353954064, ~a$w_buff1~0=~a$w_buff1~0_In353954064, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In353954064, ~a$w_buff1_used~0=~a$w_buff1_used~0_In353954064} OutVars{~a~0=~a~0_In353954064, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out353954064|, ~a$w_buff1~0=~a$w_buff1~0_In353954064, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In353954064, ~a$w_buff1_used~0=~a$w_buff1_used~0_In353954064} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:10:29,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:10:29,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1860580283 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1860580283 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1860580283| ~a$w_buff0_used~0_In1860580283) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out1860580283| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1860580283, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1860580283} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1860580283|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1860580283, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1860580283} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 20:10:29,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-531156080 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-531156080 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-531156080 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-531156080 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-531156080|)) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-531156080 |P2Thread1of1ForFork0_#t~ite41_Out-531156080|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-531156080, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-531156080, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-531156080, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-531156080} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-531156080, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-531156080, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-531156080, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-531156080, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-531156080|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 20:10:29,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-608018344 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-608018344 256) 0))) (or (and (= ~a$r_buff0_thd3~0_In-608018344 |P2Thread1of1ForFork0_#t~ite42_Out-608018344|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-608018344|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-608018344, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-608018344} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-608018344, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-608018344, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-608018344|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:10:29,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-11021623 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-11021623 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-11021623 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-11021623 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-11021623|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In-11021623 |P2Thread1of1ForFork0_#t~ite43_Out-11021623|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-11021623, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-11021623, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-11021623, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-11021623} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-11021623|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-11021623, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-11021623, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-11021623, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-11021623} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 20:10:29,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~a$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:10:29,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In1440151283 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In1440151283 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1440151283 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1440151283 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1440151283 |P1Thread1of1ForFork2_#t~ite12_Out1440151283|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1440151283|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1440151283, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1440151283, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1440151283, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1440151283} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1440151283, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1440151283, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1440151283, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1440151283|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1440151283} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 20:10:29,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-2145231777 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-2145231777 256)))) (or (and (= ~a$r_buff0_thd2~0_In-2145231777 |P1Thread1of1ForFork2_#t~ite13_Out-2145231777|) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-2145231777| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2145231777, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2145231777} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2145231777, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2145231777, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-2145231777|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 20:10:29,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-2081085775 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-2081085775 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-2081085775 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-2081085775 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-2081085775| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-2081085775| ~a$r_buff1_thd2~0_In-2081085775) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2081085775, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2081085775, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2081085775, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2081085775} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2081085775, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2081085775, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2081085775, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2081085775, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2081085775|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:10:29,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L782-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 20:10:29,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:10:29,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-580914212 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-580914212 256)))) (or (and (= ~a$w_buff1~0_In-580914212 |ULTIMATE.start_main_#t~ite47_Out-580914212|) (not .cse0) (not .cse1)) (and (= ~a~0_In-580914212 |ULTIMATE.start_main_#t~ite47_Out-580914212|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-580914212, ~a$w_buff1~0=~a$w_buff1~0_In-580914212, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-580914212, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-580914212} OutVars{~a~0=~a~0_In-580914212, ~a$w_buff1~0=~a$w_buff1~0_In-580914212, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-580914212|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-580914212, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-580914212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:10:29,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_21 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 20:10:29,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1431087210 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1431087210 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out1431087210| ~a$w_buff0_used~0_In1431087210) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1431087210| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1431087210, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1431087210} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1431087210, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1431087210|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1431087210} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 20:10:29,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In-1180227170 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1180227170 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1180227170 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-1180227170 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1180227170 |ULTIMATE.start_main_#t~ite50_Out-1180227170|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite50_Out-1180227170| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1180227170, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1180227170, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1180227170, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1180227170} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1180227170|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1180227170, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1180227170, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1180227170, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1180227170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 20:10:29,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-1455238063 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1455238063 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1455238063 |ULTIMATE.start_main_#t~ite51_Out-1455238063|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1455238063|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1455238063, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1455238063} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1455238063|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1455238063, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1455238063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 20:10:29,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In453040016 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In453040016 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In453040016 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In453040016 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out453040016|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In453040016 |ULTIMATE.start_main_#t~ite52_Out453040016|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In453040016, ~a$w_buff0_used~0=~a$w_buff0_used~0_In453040016, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In453040016, ~a$w_buff1_used~0=~a$w_buff1_used~0_In453040016} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out453040016|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In453040016, ~a$w_buff0_used~0=~a$w_buff0_used~0_In453040016, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In453040016, ~a$w_buff1_used~0=~a$w_buff1_used~0_In453040016} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 20:10:29,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 1 v_~__unbuffered_p0_EAX~0_12) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1) (= v_~__unbuffered_p0_EBX~0_12 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~a$r_buff1_thd0~0_19)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:10:29,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:10:29 BasicIcfg [2019-12-27 20:10:29,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:10:29,597 INFO L168 Benchmark]: Toolchain (without parser) took 156278.77 ms. Allocated memory was 136.3 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 20:10:29,597 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:10:29,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.50 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 99.5 MB in the beginning and 151.6 MB in the end (delta: -52.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:10:29,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.02 ms. Allocated memory is still 200.3 MB. Free memory was 151.6 MB in the beginning and 148.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:10:29,599 INFO L168 Benchmark]: Boogie Preprocessor took 38.19 ms. Allocated memory is still 200.3 MB. Free memory was 148.8 MB in the beginning and 145.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:10:29,599 INFO L168 Benchmark]: RCFGBuilder took 1000.09 ms. Allocated memory is still 200.3 MB. Free memory was 145.9 MB in the beginning and 95.5 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:10:29,599 INFO L168 Benchmark]: TraceAbstraction took 154369.02 ms. Allocated memory was 200.3 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 94.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 20:10:29,602 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.50 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 99.5 MB in the beginning and 151.6 MB in the end (delta: -52.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.02 ms. Allocated memory is still 200.3 MB. Free memory was 151.6 MB in the beginning and 148.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.19 ms. Allocated memory is still 200.3 MB. Free memory was 148.8 MB in the beginning and 145.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1000.09 ms. Allocated memory is still 200.3 MB. Free memory was 145.9 MB in the beginning and 95.5 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 154369.02 ms. Allocated memory was 200.3 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 94.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7008 VarBasedMoverChecksPositive, 202 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 83227 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L758] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 154.0s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 73.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7596 SDtfs, 17947 SDslu, 35026 SDs, 0 SdLazy, 26489 SolverSat, 1138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 954 GetRequests, 199 SyntacticMatches, 119 SemanticMatches, 636 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8057 ImplicationChecksByTransitivity, 25.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160651occurred 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: 40.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 398423 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1464 NumberOfCodeBlocks, 1464 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1365 ConstructedInterpolants, 0 QuantifiedInterpolants, 296788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...